Base | Representation |
---|---|
bin | 110000010000001111010101… |
… | …011100101010000100010010 |
3 | 1000211102020121201020221112110 |
4 | 300100033111130222010102 |
5 | 210304022041242401002 |
6 | 2031205312025410150 |
7 | 62462356130235363 |
oct | 6020172534520422 |
9 | 1024366551227473 |
10 | 212222210122002 |
11 | 61690a2aaa0783 |
12 | 1b976104939956 |
13 | 915561250c152 |
14 | 3a5987731db6a |
15 | 19805c021ae6c |
hex | c103d572a112 |
212222210122002 has 32 divisors (see below), whose sum is σ = 425162987061120. Its totient is φ = 70621047705600.
The previous prime is 212222210121953. The next prime is 212222210122009. The reversal of 212222210122002 is 200221012222212.
It is a self number, because there is not a number n which added to its sum of digits gives 212222210122002.
It is not an unprimeable number, because it can be changed into a prime (212222210122009) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2755168 + ... + 20785460.
It is an arithmetic number, because the mean of its divisors is an integer number (13286343345660).
Almost surely, 2212222210122002 is an apocalyptic number.
212222210122002 is an abundant number, since it is smaller than the sum of its proper divisors (212940776939118).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
212222210122002 is a wasteful number, since it uses less digits than its factorization.
212222210122002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18033618.
The product of its (nonzero) digits is 512, while the sum is 21.
Adding to 212222210122002 its reverse (200221012222212), we get a palindrome (412443222344214).
The spelling of 212222210122002 in words is "two hundred twelve trillion, two hundred twenty-two billion, two hundred ten million, one hundred twenty-two thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •