Base | Representation |
---|---|
bin | 10110110000101111… |
… | …01100000101001001 |
3 | 1011112122010111022122 |
4 | 23120113230011021 |
5 | 200011311214423 |
6 | 5340325301025 |
7 | 611552324354 |
oct | 133027540511 |
9 | 34478114278 |
10 | 12220023113 |
11 | 5200980261 |
12 | 2450564775 |
13 | 11c990c90c |
14 | 83cd3329b |
15 | 4b7c328c8 |
hex | 2d85ec149 |
12220023113 has 12 divisors (see below), whose sum is σ = 13075926972. Its totient is φ = 11417210880.
The previous prime is 12220023107. The next prime is 12220023131. The reversal of 12220023113 is 31132002221.
It can be written as a sum of positive squares in 6 ways, for example, as 284023609 + 11935999504 = 16853^2 + 109252^2 .
It is not a de Polignac number, because 12220023113 - 212 = 12220019017 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12220023091 and 12220023100.
It is not an unprimeable number, because it can be changed into a prime (12220023163) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 114728 + ... + 193913.
It is an arithmetic number, because the mean of its divisors is an integer number (1089660581).
Almost surely, 212220023113 is an apocalyptic number.
It is an amenable number.
12220023113 is a deficient number, since it is larger than the sum of its proper divisors (855903859).
12220023113 is a wasteful number, since it uses less digits than its factorization.
12220023113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 308812 (or 308795 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 12220023113 its reverse (31132002221), we get a palindrome (43352025334).
The spelling of 12220023113 in words is "twelve billion, two hundred twenty million, twenty-three thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •