Base | Representation |
---|---|
bin | 101111110000000011001010… |
… | …101010010101100011110001 |
3 | 1000112120202211102022102222010 |
4 | 233300003022222111203301 |
5 | 210011301211434014301 |
6 | 2022353152342433133 |
7 | 62143505401035213 |
oct | 5760031252254361 |
9 | 1015522742272863 |
10 | 210010121001201 |
11 | 60a08879397374 |
12 | 1b6794507327a9 |
13 | 9024b3c1bc3c1 |
14 | 39c0788db25b3 |
15 | 1942ca27e25d6 |
hex | bf00caa958f1 |
210010121001201 has 8 divisors (see below), whose sum is σ = 280116706435360. Its totient is φ = 139955141450592.
The previous prime is 210010121001173. The next prime is 210010121001203. The reversal of 210010121001201 is 102100121010012.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 210010121001201 - 221 = 210010118904049 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (210010121001203) 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 7 ways as a sum of consecutive naturals, for example, 12901461391 + ... + 12901477668.
It is an arithmetic number, because the mean of its divisors is an integer number (35014588304420).
Almost surely, 2210010121001201 is an apocalyptic number.
It is an amenable number.
210010121001201 is a deficient number, since it is larger than the sum of its proper divisors (70106585434159).
210010121001201 is a wasteful number, since it uses less digits than its factorization.
210010121001201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25802941775.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 210010121001201 its reverse (102100121010012), we get a palindrome (312110242011213).
The spelling of 210010121001201 in words is "two hundred ten trillion, ten billion, one hundred twenty-one million, one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •