Base | Representation |
---|---|
bin | 10110011011111010… |
… | …10110000101101111 |
3 | 1011002110102221011220 |
4 | 23031331112011233 |
5 | 144132102021020 |
6 | 5311125314423 |
7 | 604331513205 |
oct | 131575260557 |
9 | 34073387156 |
10 | 12045345135 |
11 | 512131309a |
12 | 2401b65a13 |
13 | 119c680275 |
14 | 823a63075 |
15 | 4a772b240 |
hex | 2cdf5616f |
12045345135 has 8 divisors (see below), whose sum is σ = 19272552240. Its totient is φ = 6424184064.
The previous prime is 12045345113. The next prime is 12045345163. The reversal of 12045345135 is 53154354021.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 12045345135 - 28 = 12045344879 is a prime.
It is a Smith number, since the sum of its digits (33) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a junction number, because it is equal to n+sod(n) for n = 12045345096 and 12045345105.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 401511490 + ... + 401511519.
It is an arithmetic number, because the mean of its divisors is an integer number (2409069030).
Almost surely, 212045345135 is an apocalyptic number.
12045345135 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
12045345135 is a deficient number, since it is larger than the sum of its proper divisors (7227207105).
12045345135 is an equidigital number, since it uses as much as digits as its factorization.
12045345135 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 803023017.
The product of its (nonzero) digits is 36000, while the sum is 33.
Adding to 12045345135 its reverse (53154354021), we get a palindrome (65199699156).
The spelling of 12045345135 in words is "twelve billion, forty-five million, three hundred forty-five thousand, one hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •