Base | Representation |
---|---|
bin | 10110111010010001… |
… | …10111000101100001 |
3 | 1011202012122212022120 |
4 | 23131020313011201 |
5 | 200142301201423 |
6 | 5352304054453 |
7 | 613543314531 |
oct | 133510670541 |
9 | 34665585276 |
10 | 12300022113 |
11 | 5242050735 |
12 | 2473304429 |
13 | 121036c6c2 |
14 | 8497d94c1 |
15 | 4bec85ee3 |
hex | 2dd237161 |
12300022113 has 8 divisors (see below), whose sum is σ = 16407050400. Its totient is φ = 8196504288.
The previous prime is 12300022093. The next prime is 12300022129. The reversal of 12300022113 is 31122000321.
12300022113 is digitally balanced in base 2, 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 12300022113 - 222 = 12295827809 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12300022092 and 12300022101.
It is not an unprimeable number, because it can be changed into a prime (12300026113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 869428 + ... + 883461.
It is an arithmetic number, because the mean of its divisors is an integer number (2050881300).
Almost surely, 212300022113 is an apocalyptic number.
It is an amenable number.
12300022113 is a deficient number, since it is larger than the sum of its proper divisors (4107028287).
12300022113 is a wasteful number, since it uses less digits than its factorization.
12300022113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1755231.
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 12300022113 its reverse (31122000321), we get a palindrome (43422022434).
The spelling of 12300022113 in words is "twelve billion, three hundred million, twenty-two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •