Base | Representation |
---|---|
bin | 10111010110010011… |
… | …10100100100111101 |
3 | 1012100121002212000012 |
4 | 23223021310210331 |
5 | 201132444430010 |
6 | 5431503513005 |
7 | 622430026262 |
oct | 135311644475 |
9 | 35317085005 |
10 | 12535155005 |
11 | 535284a53a |
12 | 2519bb8765 |
13 | 1249ca80a9 |
14 | 86cb25269 |
15 | 4d5730005 |
hex | 2eb27493d |
12535155005 has 4 divisors (see below), whose sum is σ = 15042186012. Its totient is φ = 10028124000.
The previous prime is 12535154987. The next prime is 12535155011. The reversal of 12535155005 is 50055153521.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 50055153521 = 14767 ⋅3389663.
It can be written as a sum of positive squares in 2 ways, for example, as 2878751716 + 9656403289 = 53654^2 + 98267^2 .
It is not a de Polignac number, because 12535155005 - 212 = 12535150909 is a prime.
It is a super-2 number, since 2×125351550052 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1253515496 + ... + 1253515505.
It is an arithmetic number, because the mean of its divisors is an integer number (3760546503).
Almost surely, 212535155005 is an apocalyptic number.
It is an amenable number.
12535155005 is a deficient number, since it is larger than the sum of its proper divisors (2507031007).
12535155005 is an equidigital number, since it uses as much as digits as its factorization.
12535155005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2507031006.
The product of its (nonzero) digits is 18750, while the sum is 32.
The spelling of 12535155005 in words is "twelve billion, five hundred thirty-five million, one hundred fifty-five thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •