Base | Representation |
---|---|
bin | 11001100010011111010001… |
… | …111101001000001100101001 |
3 | 112201200210200101212002120111 |
4 | 121202133101331020030221 |
5 | 104210232320312021301 |
6 | 1034515352541254321 |
7 | 32441640230036665 |
oct | 3142372175101451 |
9 | 481623611762514 |
10 | 112321212220201 |
11 | 328751820aa276 |
12 | 1072072a8643a1 |
13 | 4a89aca2217ca |
14 | 1da4538c098a5 |
15 | cebaec26b551 |
hex | 6627d1f48329 |
112321212220201 has 16 divisors (see below), whose sum is σ = 114868259589888. Its totient is φ = 109811121480000.
The previous prime is 112321212220181. The next prime is 112321212220219. The reversal of 112321212220201 is 102022212123211.
It is a cyclic number.
It is not a de Polignac number, because 112321212220201 - 25 = 112321212220169 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (112321212220241) 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 15 ways as a sum of consecutive naturals, for example, 19503510 + ... + 24597343.
It is an arithmetic number, because the mean of its divisors is an integer number (7179266224368).
Almost surely, 2112321212220201 is an apocalyptic number.
It is an amenable number.
112321212220201 is a deficient number, since it is larger than the sum of its proper divisors (2547047369687).
112321212220201 is a wasteful number, since it uses less digits than its factorization.
112321212220201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44101272.
The product of its (nonzero) digits is 384, while the sum is 22.
Adding to 112321212220201 its reverse (102022212123211), we get a palindrome (214343424343412).
The spelling of 112321212220201 in words is "one hundred twelve trillion, three hundred twenty-one billion, two hundred twelve million, two hundred twenty thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •