Base | Representation |
---|---|
bin | 1001010010111100111110… |
… | …0110010001000011011110 |
3 | 1100012010201201002021110201 |
4 | 2110233033212101003132 |
5 | 2314431014242042342 |
6 | 33423320433254114 |
7 | 2103313054311214 |
oct | 224571746210336 |
9 | 40163651067421 |
10 | 10221210112222 |
11 | 329087770748a |
12 | 1190b3270433a |
13 | 591b18777455 |
14 | 2749d00d8cb4 |
15 | 12ad254b9db7 |
hex | 94bcf9910de |
10221210112222 has 8 divisors (see below), whose sum is σ = 15489875118816. Its totient is φ = 5057918405952.
The previous prime is 10221210112193. The next prime is 10221210112229. The reversal of 10221210112222 is 22221101212201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a self number, because there is not a number n which added to its sum of digits gives 10221210112222.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10221210112229) 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 3 ways as a sum of consecutive naturals, for example, 26343324838 + ... + 26343325225.
It is an arithmetic number, because the mean of its divisors is an integer number (1936234389852).
Almost surely, 210221210112222 is an apocalyptic number.
10221210112222 is a deficient number, since it is larger than the sum of its proper divisors (5268665006594).
10221210112222 is an equidigital number, since it uses as much as digits as its factorization.
10221210112222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52686650162.
The product of its (nonzero) digits is 128, while the sum is 19.
Adding to 10221210112222 its reverse (22221101212201), we get a palindrome (32442311324423).
The spelling of 10221210112222 in words is "ten trillion, two hundred twenty-one billion, two hundred ten million, one hundred twelve thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •