Base | Representation |
---|---|
bin | 11011100000111101001101… |
… | …111000111000100110011010 |
3 | 120212110122011001202001100110 |
4 | 123200331031320320212122 |
5 | 111330130044120303310 |
6 | 1105212052230145150 |
7 | 34326554266041201 |
oct | 3340751570704632 |
9 | 525418131661313 |
10 | 121012010322330 |
11 | 356159a6061026 |
12 | 116a4b314b21b6 |
13 | 526a4caa324ca |
14 | 21c5026620238 |
15 | decc004cad20 |
hex | 6e0f4de3899a |
121012010322330 has 64 divisors (see below), whose sum is σ = 290976282809856. Its totient is φ = 32209097544000.
The previous prime is 121012010322311. The next prime is 121012010322331. The reversal of 121012010322330 is 33223010210121.
It is a junction number, because it is equal to n+sod(n) for n = 121012010322297 and 121012010322306.
It is not an unprimeable number, because it can be changed into a prime (121012010322331) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 32337445 + ... + 35885015.
It is an arithmetic number, because the mean of its divisors is an integer number (4546504418904).
Almost surely, 2121012010322330 is an apocalyptic number.
121012010322330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
121012010322330 is an abundant number, since it is smaller than the sum of its proper divisors (169964272487526).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121012010322330 is a wasteful number, since it uses less digits than its factorization.
121012010322330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3549723.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 121012010322330 its reverse (33223010210121), we get a palindrome (154235020532451).
The spelling of 121012010322330 in words is "one hundred twenty-one trillion, twelve billion, ten million, three hundred twenty-two thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •