Base | Representation |
---|---|
bin | 1011000011100111000100… |
… | …10001011000010000111100 |
3 | 10012002022220110021021112020 |
4 | 11201303202101120100330 |
5 | 11141322130120231022 |
6 | 123413214140240140 |
7 | 5056402341324102 |
oct | 541634221302074 |
9 | 105068813237466 |
10 | 24313311102012 |
11 | 78242432a7959 |
12 | 28880ba840050 |
13 | 1074973896b9a |
14 | 600ab04cbc72 |
15 | 2c26a1e0535c |
hex | 161ce245843c |
24313311102012 has 24 divisors (see below), whose sum is σ = 56880745420800. Its totient is φ = 8083053293616.
The previous prime is 24313311101869. The next prime is 24313311102103. The reversal of 24313311102012 is 21020111331342.
It is a super-2 number, since 2×243133111020122 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2672962812 + ... + 2672971907.
It is an arithmetic number, because the mean of its divisors is an integer number (2370031059200).
Almost surely, 224313311102012 is an apocalyptic number.
It is an amenable number.
24313311102012 is an abundant number, since it is smaller than the sum of its proper divisors (32567434318788).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
24313311102012 is a wasteful number, since it uses less digits than its factorization.
24313311102012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5345935105 (or 5345935103 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 24.
Adding to 24313311102012 its reverse (21020111331342), we get a palindrome (45333422433354).
The spelling of 24313311102012 in words is "twenty-four trillion, three hundred thirteen billion, three hundred eleven million, one hundred two thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •