Base | Representation |
---|---|
bin | 10011110101110000… |
… | …111101010001110101 |
3 | 2000222122120200012222 |
4 | 103311300331101311 |
5 | 322112044333023 |
6 | 13441515452125 |
7 | 1352624353346 |
oct | 236560752165 |
9 | 60878520188 |
10 | 21303121013 |
11 | 9042069139 |
12 | 4166457045 |
13 | 2016666365 |
14 | 10613ba0cd |
15 | 84a375cc8 |
hex | 4f5c3d475 |
21303121013 has 4 divisors (see below), whose sum is σ = 21391515948. Its totient is φ = 21214726080.
The previous prime is 21303121009. The next prime is 21303121061. The reversal of 21303121013 is 31012130312.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 15569299729 + 5733821284 = 124777^2 + 75722^2 .
It is a cyclic number.
It is not a de Polignac number, because 21303121013 - 22 = 21303121009 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 21303120982 and 21303121000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21303121003) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 44197106 + ... + 44197587.
It is an arithmetic number, because the mean of its divisors is an integer number (5347878987).
Almost surely, 221303121013 is an apocalyptic number.
It is an amenable number.
21303121013 is a deficient number, since it is larger than the sum of its proper divisors (88394935).
21303121013 is an equidigital number, since it uses as much as digits as its factorization.
21303121013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 88394934.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 21303121013 its reverse (31012130312), we get a palindrome (52315251325).
The spelling of 21303121013 in words is "twenty-one billion, three hundred three million, one hundred twenty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •