Base | Representation |
---|---|
bin | 10011000010100100… |
… | …10000110100001101 |
3 | 222101101201002112020 |
4 | 21201102100310031 |
5 | 131413330041023 |
6 | 4410155200353 |
7 | 511212342561 |
oct | 114122206415 |
9 | 28341632466 |
10 | 10222112013 |
11 | 4376130063 |
12 | 1b934460b9 |
13 | c6ba172b9 |
14 | 6cd85d6a1 |
15 | 3ec633de3 |
hex | 261490d0d |
10222112013 has 8 divisors (see below), whose sum is σ = 13640400000. Its totient is φ = 6809282688.
The previous prime is 10222112011. The next prime is 10222112029. The reversal of 10222112013 is 31021122201.
10222112013 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10222112013 - 21 = 10222112011 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10222111983 and 10222112001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10222112011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1360293 + ... + 1367786.
It is an arithmetic number, because the mean of its divisors is an integer number (1705050000).
Almost surely, 210222112013 is an apocalyptic number.
It is an amenable number.
10222112013 is a deficient number, since it is larger than the sum of its proper divisors (3418287987).
10222112013 is a wasteful number, since it uses less digits than its factorization.
10222112013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2729331.
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 10222112013 its reverse (31021122201), we get a palindrome (41243234214).
The spelling of 10222112013 in words is "ten billion, two hundred twenty-two million, one hundred twelve thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •