Base | Representation |
---|---|
bin | 10111011000011011… |
… | …11010010100010001 |
3 | 1012101211200200122101 |
4 | 23230031322110101 |
5 | 201202032114210 |
6 | 5433342240401 |
7 | 623034530122 |
oct | 135415722421 |
9 | 35354620571 |
10 | 12553004305 |
11 | 5361930a26 |
12 | 2523b86101 |
13 | 12508b75ca |
14 | 871250049 |
15 | 4d70a8a3a |
hex | 2ec37a511 |
12553004305 has 4 divisors (see below), whose sum is σ = 15063605172. Its totient is φ = 10042403440.
The previous prime is 12553004287. The next prime is 12553004333. The reversal of 12553004305 is 50340035521.
12553004305 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 2273477761 + 10279526544 = 47681^2 + 101388^2 .
It is not a de Polignac number, because 12553004305 - 223 = 12544615697 is a prime.
It is a Duffinian number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 1255300426 + ... + 1255300435.
It is an arithmetic number, because the mean of its divisors is an integer number (3765901293).
Almost surely, 212553004305 is an apocalyptic number.
It is an amenable number.
12553004305 is a deficient number, since it is larger than the sum of its proper divisors (2510600867).
12553004305 is an equidigital number, since it uses as much as digits as its factorization.
12553004305 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2510600866.
The product of its (nonzero) digits is 9000, while the sum is 28.
Adding to 12553004305 its reverse (50340035521), we get a palindrome (62893039826).
The spelling of 12553004305 in words is "twelve billion, five hundred fifty-three million, four thousand, three hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •