Base | Representation |
---|---|
bin | 1011000110001001010111… |
… | …0110100010010011101011 |
3 | 1121012022220101122000222211 |
4 | 2301202111312202103223 |
5 | 3044342023113101443 |
6 | 41540412041425551 |
7 | 2366302566222664 |
oct | 261422566422353 |
9 | 47168811560884 |
10 | 12200221222123 |
11 | 39840a2903500 |
12 | 145059949b2b7 |
13 | 6a66257b680c |
14 | 3026cb20836b |
15 | 1625509e219d |
hex | b1895da24eb |
12200221222123 has 6 divisors (see below), whose sum is σ = 13410160517012. Its totient is φ = 11091110201820.
The previous prime is 12200221222121. The next prime is 12200221222127. The reversal of 12200221222123 is 32122212200221.
It is a happy number.
12200221222123 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 12200221222123 - 21 = 12200221222121 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12200221222094 and 12200221222103.
It is not an unprimeable number, because it can be changed into a prime (12200221222121) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 50414137161 + ... + 50414137402.
Almost surely, 212200221222123 is an apocalyptic number.
12200221222123 is a deficient number, since it is larger than the sum of its proper divisors (1209939294889).
12200221222123 is a wasteful number, since it uses less digits than its factorization.
12200221222123 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 100828274585 (or 100828274574 counting only the distinct ones).
The product of its (nonzero) digits is 768, while the sum is 22.
Adding to 12200221222123 its reverse (32122212200221), we get a palindrome (44322433422344).
The spelling of 12200221222123 in words is "twelve trillion, two hundred billion, two hundred twenty-one million, two hundred twenty-two thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •