Base | Representation |
---|---|
bin | 101111110001101010100010… |
… | …101111001011001001010001 |
3 | 1000112222101100011010121011211 |
4 | 233301222202233023021101 |
5 | 210020111023301032241 |
6 | 2022520150551340121 |
7 | 62154515145543514 |
oct | 5761524257131121 |
9 | 1015871304117154 |
10 | 210121120330321 |
11 | 60a50959642212 |
12 | 1b696a6a081641 |
13 | 903244b74ccc5 |
14 | 39c5cb8baad7b |
15 | 1945aec4d7781 |
hex | bf1aa2bcb251 |
210121120330321 has 16 divisors (see below), whose sum is σ = 220140682288128. Its totient is φ = 200175288610000.
The previous prime is 210121120330313. The next prime is 210121120330333. The reversal of 210121120330321 is 123033021121012.
It is not a de Polignac number, because 210121120330321 - 23 = 210121120330313 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 210121120330292 and 210121120330301.
It is not an unprimeable number, because it can be changed into a prime (210121120300321) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 123778716 + ... + 125464786.
It is an arithmetic number, because the mean of its divisors is an integer number (13758792643008).
Almost surely, 2210121120330321 is an apocalyptic number.
It is an amenable number.
210121120330321 is a deficient number, since it is larger than the sum of its proper divisors (10019561957807).
210121120330321 is a wasteful number, since it uses less digits than its factorization.
210121120330321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1707932.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 210121120330321 its reverse (123033021121012), we get a palindrome (333154141451333).
The spelling of 210121120330321 in words is "two hundred ten trillion, one hundred twenty-one billion, one hundred twenty million, three hundred thirty thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •