Base | Representation |
---|---|
bin | 10110110100101100… |
… | …01000011000111101 |
3 | 1011121221111111012222 |
4 | 23122112020120331 |
5 | 200043302403323 |
6 | 5343511535125 |
7 | 612434135255 |
oct | 133226103075 |
9 | 34557444188 |
10 | 12253169213 |
11 | 521865a42a |
12 | 245b68a4a5 |
13 | 12037468ac |
14 | 8434c0965 |
15 | 4baacd9c8 |
hex | 2da58863d |
12253169213 has 8 divisors (see below), whose sum is σ = 12704160000. Its totient is φ = 11805661440.
The previous prime is 12253169183. The next prime is 12253169219. The reversal of 12253169213 is 31296135221.
12253169213 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 a cyclic number.
It is not a de Polignac number, because 12253169213 - 212 = 12253165117 is a prime.
It is a super-2 number, since 2×122531692132 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12253169219) 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, 863588 + ... + 877661.
It is an arithmetic number, because the mean of its divisors is an integer number (1588020000).
Almost surely, 212253169213 is an apocalyptic number.
It is an amenable number.
12253169213 is a deficient number, since it is larger than the sum of its proper divisors (450990787).
12253169213 is a wasteful number, since it uses less digits than its factorization.
12253169213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1741507.
The product of its digits is 19440, while the sum is 35.
The spelling of 12253169213 in words is "twelve billion, two hundred fifty-three million, one hundred sixty-nine thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •