Base | Representation |
---|---|
bin | 1100010110100001001… |
… | …0101000111000010001 |
3 | 202021201210121002212122 |
4 | 3011220102220320101 |
5 | 11434042444122001 |
6 | 241252413104025 |
7 | 21221406464564 |
oct | 3055022507021 |
9 | 667653532778 |
10 | 212203114001 |
11 | 81aa414238a |
12 | 35162488015 |
13 | 1701a58b4a8 |
14 | a3b0a924db |
15 | 57be966b1b |
hex | 31684a8e11 |
212203114001 has 4 divisors (see below), whose sum is σ = 212204266212. Its totient is φ = 212201961792.
The previous prime is 212203113973. The next prime is 212203114007. The reversal of 212203114001 is 100411302212.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It can be written as a sum of positive squares in 2 ways, for example, as 92659360000 + 119543754001 = 304400^2 + 345751^2 .
It is a cyclic number.
It is not a de Polignac number, because 212203114001 - 222 = 212198919697 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (212203114007) 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, 230900 + ... + 691173.
It is an arithmetic number, because the mean of its divisors is an integer number (53051066553).
Almost surely, 2212203114001 is an apocalyptic number.
It is an amenable number.
212203114001 is a deficient number, since it is larger than the sum of its proper divisors (1152211).
212203114001 is an equidigital number, since it uses as much as digits as its factorization.
212203114001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1152210.
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 212203114001 its reverse (100411302212), we get a palindrome (312614416213).
The spelling of 212203114001 in words is "two hundred twelve billion, two hundred three million, one hundred fourteen thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •