Base | Representation |
---|---|
bin | 1011000110110101010100… |
… | …0111010011100101001101 |
3 | 1121020110100200010002222211 |
4 | 2301231111013103211031 |
5 | 3100040204110013401 |
6 | 41550042522310421 |
7 | 2400201145205344 |
oct | 261552507234515 |
9 | 47213320102884 |
10 | 12212020001101 |
11 | 39890a7a18808 |
12 | 1452930958411 |
13 | 6a778605733b |
14 | 3030ca206b5b |
15 | 1629e1766951 |
hex | b1b551d394d |
12212020001101 has 8 divisors (see below), whose sum is σ = 12635418316320. Its totient is φ = 11788774631088.
The previous prime is 12212020001081. The next prime is 12212020001173. The reversal of 12212020001101 is 10110002021221.
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 12212020001101 - 225 = 12211986446669 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12212020001191) 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, 38073831 + ... + 38393236.
It is an arithmetic number, because the mean of its divisors is an integer number (1579427289540).
Almost surely, 212212020001101 is an apocalyptic number.
It is an amenable number.
12212020001101 is a deficient number, since it is larger than the sum of its proper divisors (423398315219).
12212020001101 is an equidigital number, since it uses as much as digits as its factorization.
12212020001101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 76472603.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 12212020001101 its reverse (10110002021221), we get a palindrome (22322022022322).
The spelling of 12212020001101 in words is "twelve trillion, two hundred twelve billion, twenty million, one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •