Base | Representation |
---|---|
bin | 1001101100100001101001… |
… | …01010111000000100101111 |
3 | 2210111021111012122200121012 |
4 | 10312100310222320010233 |
5 | 10243311103413443203 |
6 | 113202440112055435 |
7 | 4330253523630242 |
oct | 466206452700457 |
9 | 83437435580535 |
10 | 21321101312303 |
11 | 688025693a501 |
12 | 248420983457b |
13 | bb8756ca5b90 |
14 | 539d3808d259 |
15 | 26e92656bbd8 |
hex | 136434ab812f |
21321101312303 has 8 divisors (see below), whose sum is σ = 22961419698000. Its totient is φ = 19680816307968.
The previous prime is 21321101312219. The next prime is 21321101312321. The reversal of 21321101312303 is 30321310112312.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 21321101312303 - 28 = 21321101312047 is a prime.
It is a super-2 number, since 2×213211013123032 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21321101312323) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7010873 + ... + 9580946.
It is an arithmetic number, because the mean of its divisors is an integer number (2870177462250).
Almost surely, 221321101312303 is an apocalyptic number.
21321101312303 is a deficient number, since it is larger than the sum of its proper divisors (1640318385697).
21321101312303 is a wasteful number, since it uses less digits than its factorization.
21321101312303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16690681.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 21321101312303 its reverse (30321310112312), we get a palindrome (51642411424615).
The spelling of 21321101312303 in words is "twenty-one trillion, three hundred twenty-one billion, one hundred one million, three hundred twelve thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •