Base | Representation |
---|---|
bin | 100001110001100111110… |
… | …101000100001110001100 |
3 | 22012212222011201011220120 |
4 | 201301213311010032030 |
5 | 301011424210212022 |
6 | 4534132553544540 |
7 | 326455101031401 |
oct | 41614765041614 |
9 | 8185864634816 |
10 | 2321024304012 |
11 | 81538278a947 |
12 | 3159b6415150 |
13 | 13ab4403724b |
14 | 804a3d502a8 |
15 | 405962d9d5c |
hex | 21c67d4438c |
2321024304012 has 24 divisors (see below), whose sum is σ = 5602472458800. Its totient is φ = 746996327616.
The previous prime is 2321024304007. The next prime is 2321024304019. The reversal of 2321024304012 is 2104034201232.
It is a happy number.
It is a super-2 number, since 2×23210243040122 (a number of 26 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (2321024304019) by changing a digit.
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, 3334804687 + ... + 3334805382.
It is an arithmetic number, because the mean of its divisors is an integer number (233436352450).
Almost surely, 22321024304012 is an apocalyptic number.
It is an amenable number.
2321024304012 is an abundant number, since it is smaller than the sum of its proper divisors (3281448154788).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2321024304012 is a wasteful number, since it uses less digits than its factorization.
2321024304012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6669610105 (or 6669610103 counting only the distinct ones).
The product of its (nonzero) digits is 2304, while the sum is 24.
Adding to 2321024304012 its reverse (2104034201232), we get a palindrome (4425058505244).
The spelling of 2321024304012 in words is "two trillion, three hundred twenty-one billion, twenty-four million, three hundred four thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •