Base | Representation |
---|---|
bin | 1100010110001001000… |
… | …1011001001101110001 |
3 | 202021110202120022012002 |
4 | 3011202101121031301 |
5 | 11433341120440101 |
6 | 241234404343345 |
7 | 21216042211346 |
oct | 3054221311561 |
9 | 667422508162 |
10 | 212102124401 |
11 | 81a52135402 |
12 | 351346a4b55 |
13 | 1700268c42b |
14 | a3a14c47cd |
15 | 57b5b68d6b |
hex | 3162459371 |
212102124401 has 8 divisors (see below), whose sum is σ = 225956506464. Its totient is φ = 198400829760.
The previous prime is 212102124397. The next prime is 212102124407. The reversal of 212102124401 is 104421201212.
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 212102124401 - 22 = 212102124397 is a prime.
It is a super-2 number, since 2×2121021244012 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (212102124407) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 38268995 + ... + 38274536.
It is an arithmetic number, because the mean of its divisors is an integer number (28244563308).
Almost surely, 2212102124401 is an apocalyptic number.
It is an amenable number.
212102124401 is a deficient number, since it is larger than the sum of its proper divisors (13854382063).
212102124401 is a wasteful number, since it uses less digits than its factorization.
212102124401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 76543711.
The product of its (nonzero) digits is 256, while the sum is 20.
Adding to 212102124401 its reverse (104421201212), we get a palindrome (316523325613).
The spelling of 212102124401 in words is "two hundred twelve billion, one hundred two million, one hundred twenty-four thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •