Base | Representation |
---|---|
bin | 1011000111011110100110… |
… | …1010100010110100011001 |
3 | 1121021111222000020012110010 |
4 | 2301313221222202310121 |
5 | 3100230403130413423 |
6 | 41555114324312133 |
7 | 2401042603306356 |
oct | 261675152426431 |
9 | 47244860205403 |
10 | 12223102201113 |
11 | 399287459a6a1 |
12 | 1454b04242649 |
13 | 6a883100253b |
14 | 30385bd9362d |
15 | 162e3e641693 |
hex | b1de9aa2d19 |
12223102201113 has 16 divisors (see below), whose sum is σ = 17218163047680. Its totient is φ = 7700345135616.
The previous prime is 12223102201111. The next prime is 12223102201129. The reversal of 12223102201113 is 31110220132221.
It is not a de Polignac number, because 12223102201113 - 21 = 12223102201111 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 12223102201113.
It is not an unprimeable number, because it can be changed into a prime (12223102201111) 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 15 ways as a sum of consecutive naturals, for example, 1494628120 + ... + 1494636297.
It is an arithmetic number, because the mean of its divisors is an integer number (1076135190480).
Almost surely, 212223102201113 is an apocalyptic number.
It is an amenable number.
12223102201113 is a deficient number, since it is larger than the sum of its proper divisors (4995060846567).
12223102201113 is a wasteful number, since it uses less digits than its factorization.
12223102201113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2989264496.
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 12223102201113 its reverse (31110220132221), we get a palindrome (43333322333334).
The spelling of 12223102201113 in words is "twelve trillion, two hundred twenty-three billion, one hundred two million, two hundred one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •