Base | Representation |
---|---|
bin | 101111110001101010011100… |
… | …110100101011101100111101 |
3 | 1000112222101002020102201222220 |
4 | 233301222130310223230331 |
5 | 210020110322401023401 |
6 | 2022520133044555553 |
7 | 62154512532312612 |
oct | 5761523464535475 |
9 | 1015871066381886 |
10 | 210121021111101 |
11 | 60a50908634361 |
12 | 1b696a409b2bb9 |
13 | 90324340209c9 |
14 | 39c5ca9940509 |
15 | 1945ae3939336 |
hex | bf1a9cd2bb3d |
210121021111101 has 8 divisors (see below), whose sum is σ = 280162491897024. Its totient is φ = 140080115532960.
The previous prime is 210121021111061. The next prime is 210121021111153. The reversal of 210121021111101 is 101111120121012.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 210121021111101 - 233 = 210112431176509 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (210121021111201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 140433745 + ... + 141922086.
It is an arithmetic number, because the mean of its divisors is an integer number (35020311487128).
Almost surely, 2210121021111101 is an apocalyptic number.
It is an amenable number.
210121021111101 is a deficient number, since it is larger than the sum of its proper divisors (70041470785923).
210121021111101 is a wasteful number, since it uses less digits than its factorization.
210121021111101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 282603891.
The product of its (nonzero) digits is 8, while the sum is 15.
Adding to 210121021111101 its reverse (101111120121012), we get a palindrome (311232141232113).
The spelling of 210121021111101 in words is "two hundred ten trillion, one hundred twenty-one billion, twenty-one million, one hundred eleven thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •