Base | Representation |
---|---|
bin | 10001110010001100001… |
… | …001011101011100111110 |
3 | 11022211111210011021001200 |
4 | 101302030021131130332 |
5 | 130010401213032423 |
6 | 2333233551520330 |
7 | 154203215422254 |
oct | 21621411353476 |
9 | 4284453137050 |
10 | 1222122002238 |
11 | 431332011875 |
12 | 178a322290a6 |
13 | 8b3267b5067 |
14 | 432185865d4 |
15 | 21bcbdb7d43 |
hex | 11c8c25d73e |
1222122002238 has 48 divisors (see below), whose sum is σ = 2651621356800. Its totient is φ = 406806543360.
The previous prime is 1222122002209. The next prime is 1222122002239. The reversal of 1222122002238 is 8322002212221.
It is a happy number.
1222122002238 is a `hidden beast` number, since 1 + 2 + 221 + 2 + 200 + 2 + 238 = 666.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1222122002239) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 63015523 + ... + 63034913.
It is an arithmetic number, because the mean of its divisors is an integer number (55242111600).
Almost surely, 21222122002238 is an apocalyptic number.
1222122002238 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
1222122002238 is an abundant number, since it is smaller than the sum of its proper divisors (1429499354562).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1222122002238 is a wasteful number, since it uses less digits than its factorization.
1222122002238 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24097 (or 24094 counting only the distinct ones).
The product of its (nonzero) digits is 3072, while the sum is 27.
Adding to 1222122002238 its reverse (8322002212221), we get a palindrome (9544124214459).
The spelling of 1222122002238 in words is "one trillion, two hundred twenty-two billion, one hundred twenty-two million, two thousand, two hundred thirty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •