Base | Representation |
---|---|
bin | 100001110001101101101… |
… | …010001101110100000100 |
3 | 22012220012222202220100111 |
4 | 201301231222031310010 |
5 | 301012124230414022 |
6 | 4534150410322404 |
7 | 326460366341110 |
oct | 41615552156404 |
9 | 8186188686314 |
10 | 2321122123012 |
11 | 815422a217a0 |
12 | 315a23129404 |
13 | 13ab5b396104 |
14 | 804b2d34740 |
15 | 4059ebad477 |
hex | 21c6da8dd04 |
2321122123012 has 24 divisors (see below), whose sum is σ = 5064266450880. Its totient is φ = 904333294560.
The previous prime is 2321122123009. The next prime is 2321122123087. The reversal of 2321122123012 is 2103212211232.
It is a Harshad number since it is a multiple of its sum of digits (22).
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, 3768055087 + ... + 3768055702.
It is an arithmetic number, because the mean of its divisors is an integer number (211011102120).
Almost surely, 22321122123012 is an apocalyptic number.
2321122123012 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
2321122123012 is an abundant number, since it is smaller than the sum of its proper divisors (2743144327868).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2321122123012 is a wasteful number, since it uses less digits than its factorization.
2321122123012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7536110811 (or 7536110809 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 2321122123012 its reverse (2103212211232), we get a palindrome (4424334334244).
The spelling of 2321122123012 in words is "two trillion, three hundred twenty-one billion, one hundred twenty-two million, one hundred twenty-three thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •