Base | Representation |
---|---|
bin | 110000001101010100000011… |
… | …100010110000101011111001 |
3 | 1000210201000120101201212212112 |
4 | 300031110003202300223321 |
5 | 210242223223210323001 |
6 | 2030533054034422105 |
7 | 62442010001423240 |
oct | 6015240342605371 |
9 | 1023630511655775 |
10 | 212021120011001 |
11 | 61613719959aa4 |
12 | 1b943144131935 |
13 | 913c6763c24a2 |
14 | 3a4dc3c555957 |
15 | 197a251215cbb |
hex | c0d5038b0af9 |
212021120011001 has 8 divisors (see below), whose sum is σ = 242312661292800. Its totient is φ = 181730281192128.
The previous prime is 212021120010967. The next prime is 212021120011009. The reversal of 212021120011001 is 100110021120212.
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 212021120011001 - 246 = 141652375833337 is a prime.
It is a super-2 number, since 2×2120211200110012 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (212021120011009) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 174968801 + ... + 176176398.
It is an arithmetic number, because the mean of its divisors is an integer number (30289082661600).
Almost surely, 2212021120011001 is an apocalyptic number.
It is an amenable number.
212021120011001 is a deficient number, since it is larger than the sum of its proper divisors (30291541281799).
212021120011001 is an equidigital number, since it uses as much as digits as its factorization.
212021120011001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 351231463.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 212021120011001 its reverse (100110021120212), we get a palindrome (312131141131213).
The spelling of 212021120011001 in words is "two hundred twelve trillion, twenty-one billion, one hundred twenty million, eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •