Base | Representation |
---|---|
bin | 1100001110110000110… |
… | …0011011111011110011 |
3 | 202002100200221111212201 |
4 | 3003230030123323303 |
5 | 11420312001111311 |
6 | 240310040404031 |
7 | 21115665665023 |
oct | 3035414337363 |
9 | 662320844781 |
10 | 210121113331 |
11 | 81125988478 |
12 | 34881176617 |
13 | 16a7813322c |
14 | a25436da83 |
15 | 56ebca79c1 |
hex | 30ec31bef3 |
210121113331 has 8 divisors (see below), whose sum is σ = 211651504128. Its totient is φ = 208595205000.
The previous prime is 210121113311. The next prime is 210121113337. The reversal of 210121113331 is 133311121012.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 210121113331 - 29 = 210121112819 is a prime.
It is a super-2 number, since 2×2101211133312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 210121113299 and 210121113308.
It is not an unprimeable number, because it can be changed into a prime (210121113337) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1026495 + ... + 1214056.
It is an arithmetic number, because the mean of its divisors is an integer number (26456438016).
Almost surely, 2210121113331 is an apocalyptic number.
210121113331 is a deficient number, since it is larger than the sum of its proper divisors (1530390797).
210121113331 is a wasteful number, since it uses less digits than its factorization.
210121113331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2241233.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 210121113331 its reverse (133311121012), we get a palindrome (343432234343).
The spelling of 210121113331 in words is "two hundred ten billion, one hundred twenty-one million, one hundred thirteen thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •