Base | Representation |
---|---|
bin | 1001101100100101011001… |
… | …00101010110100001111110 |
3 | 2210111110200102020121210211 |
4 | 10312102230211112201332 |
5 | 10243324213430130420 |
6 | 113203411500223034 |
7 | 4330354423042261 |
oct | 466225445264176 |
9 | 83443612217724 |
10 | 21323113130110 |
11 | 6881099518a50 |
12 | 248468b53aa7a |
13 | bb89b7a2a30c |
14 | 53a089342cd8 |
15 | 26e9e2eb5e5a |
hex | 1364ac95687e |
21323113130110 has 64 divisors (see below), whose sum is σ = 42131623668480. Its totient is φ = 7705574945280.
The previous prime is 21323113130063. The next prime is 21323113130113. The reversal of 21323113130110 is 1103131132312.
It is a super-2 number, since 2×213231131301102 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21323113130113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 217137001 + ... + 217235179.
It is an arithmetic number, because the mean of its divisors is an integer number (658306619820).
Almost surely, 221323113130110 is an apocalyptic number.
21323113130110 is a deficient number, since it is larger than the sum of its proper divisors (20808510538370).
21323113130110 is a wasteful number, since it uses less digits than its factorization.
21323113130110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 110473.
The product of its (nonzero) digits is 324, while the sum is 22.
Adding to 21323113130110 its reverse (1103131132312), we get a palindrome (22426244262422).
The spelling of 21323113130110 in words is "twenty-one trillion, three hundred twenty-three billion, one hundred thirteen million, one hundred thirty thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •