Base | Representation |
---|---|
bin | 1010000000010100011100… |
… | …11011101011110101001001 |
3 | 2212220021222022010000222022 |
4 | 11000022032123223311021 |
5 | 10340431440300042301 |
6 | 114443114534534225 |
7 | 4430351355222530 |
oct | 500121633536511 |
9 | 85807868100868 |
10 | 22001212112201 |
11 | 7012730737743 |
12 | 2573b95507375 |
13 | c379229c065a |
14 | 560c15ab1317 |
15 | 28247e492d1b |
hex | 14028e6ebd49 |
22001212112201 has 8 divisors (see below), whose sum is σ = 25294806741120. Its totient is φ = 18745258565088.
The previous prime is 22001212112147. The next prime is 22001212112221. The reversal of 22001212112201 is 10221121210022.
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 22001212112201 - 230 = 22000138370377 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 22001212112201.
It is not an unprimeable number, because it can be changed into a prime (22001212112221) 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, 9410269196 + ... + 9410271533.
It is an arithmetic number, because the mean of its divisors is an integer number (3161850842640).
Almost surely, 222001212112201 is an apocalyptic number.
It is an amenable number.
22001212112201 is a deficient number, since it is larger than the sum of its proper divisors (3293594628919).
22001212112201 is a wasteful number, since it uses less digits than its factorization.
22001212112201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18820540903.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 22001212112201 its reverse (10221121210022), we get a palindrome (32222333322223).
The spelling of 22001212112201 in words is "twenty-two trillion, one billion, two hundred twelve million, one hundred twelve thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •