Base | Representation |
---|---|
bin | 110000001110011101101101… |
… | …001000110111111001001010 |
3 | 1000210222120200200121102120212 |
4 | 300032131231020313321022 |
5 | 210300022202430133002 |
6 | 2031033253123121122 |
7 | 62450506464054560 |
oct | 6016355510677112 |
9 | 1023876620542525 |
10 | 212100201021002 |
11 | 61644210043308 |
12 | 1b9565342131a2 |
13 | 9146c6a012128 |
14 | 3a539c122da30 |
15 | 197c32dba6352 |
hex | c0e76d237e4a |
212100201021002 has 8 divisors (see below), whose sum is σ = 363600344607456. Its totient is φ = 90900086151852.
The previous prime is 212100201021001. The next prime is 212100201021011. The reversal of 212100201021002 is 200120102001212.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (14), and also a Moran number because the ratio is a prime number: 15150014358643 = 212100201021002 / (2 + 1 + 2 + 1 + 0 + 0 + 2 + 0 + 1 + 0 + 2 + 1 + 0 + 0 + 2).
It is not an unprimeable number, because it can be changed into a prime (212100201021001) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7575007179308 + ... + 7575007179335.
It is an arithmetic number, because the mean of its divisors is an integer number (45450043075932).
Almost surely, 2212100201021002 is an apocalyptic number.
212100201021002 is a deficient number, since it is larger than the sum of its proper divisors (151500143586454).
212100201021002 is a wasteful number, since it uses less digits than its factorization.
212100201021002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15150014358652.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 212100201021002 its reverse (200120102001212), we get a palindrome (412220303022214).
The spelling of 212100201021002 in words is "two hundred twelve trillion, one hundred billion, two hundred one million, twenty-one thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •