Base | Representation |
---|---|
bin | 1011001101101101001101… |
… | …0011101110001100000110 |
3 | 1121122202010221220201011102 |
4 | 2303123103103232030012 |
5 | 3104004021413131042 |
6 | 42120211554340102 |
7 | 2411551255541030 |
oct | 263332323561406 |
9 | 47582127821142 |
10 | 12330101302022 |
11 | 3a24191815909 |
12 | 14717a5b8a632 |
13 | 6b59538918ba |
14 | 308acc7b8c50 |
15 | 165b03068b32 |
hex | b36d34ee306 |
12330101302022 has 32 divisors (see below), whose sum is σ = 21198356325120. Its totient is φ = 5269076114400.
The previous prime is 12330101302019. The next prime is 12330101302027. The reversal of 12330101302022 is 22020310103321.
It is a super-2 number, since 2×123301013020222 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 12330101301985 and 12330101302003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12330101302027) 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 15 ways as a sum of consecutive naturals, for example, 21207788 + ... + 21781424.
It is an arithmetic number, because the mean of its divisors is an integer number (662448635160).
Almost surely, 212330101302022 is an apocalyptic number.
12330101302022 is a deficient number, since it is larger than the sum of its proper divisors (8868255023098).
12330101302022 is a wasteful number, since it uses less digits than its factorization.
12330101302022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 578076.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 12330101302022 its reverse (22020310103321), we get a palindrome (34350411405343).
The spelling of 12330101302022 in words is "twelve trillion, three hundred thirty billion, one hundred one million, three hundred two thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •