Base | Representation |
---|---|
bin | 1001101001111000100010… |
… | …00101100011100010111001 |
3 | 2210011121010210210211001110 |
4 | 10310330101011203202321 |
5 | 10240314133330404423 |
6 | 113053023023310533 |
7 | 4320560605416045 |
oct | 464742105434271 |
9 | 83147123724043 |
10 | 21230310013113 |
11 | 68457a6590643 |
12 | 246a6aba4b449 |
13 | bb0018259136 |
14 | 5357a404d025 |
15 | 26c3b09d6193 |
hex | 134f111638b9 |
21230310013113 has 16 divisors (see below), whose sum is σ = 28408389057216. Its totient is φ = 14102887518720.
The previous prime is 21230310013027. The next prime is 21230310013217. The reversal of 21230310013113 is 31131001303212.
It is a happy number.
It is not a de Polignac number, because 21230310013113 - 220 = 21230308964537 is a prime.
It is a super-2 number, since 2×212303100131132 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 21230310013113.
It is not an unprimeable number, because it can be changed into a prime (21230314013113) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 46807806 + ... + 47259192.
It is an arithmetic number, because the mean of its divisors is an integer number (1775524316076).
Almost surely, 221230310013113 is an apocalyptic number.
It is an amenable number.
21230310013113 is a deficient number, since it is larger than the sum of its proper divisors (7178079044103).
21230310013113 is a wasteful number, since it uses less digits than its factorization.
21230310013113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 507464.
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 21230310013113 its reverse (31131001303212), we get a palindrome (52361311316325).
The spelling of 21230310013113 in words is "twenty-one trillion, two hundred thirty billion, three hundred ten million, thirteen thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •