Base | Representation |
---|---|
bin | 10110101000111111… |
… | …01001111100100111 |
3 | 1011101002210010000211 |
4 | 23110133221330213 |
5 | 144343140041123 |
6 | 5330043520251 |
7 | 610132550356 |
oct | 132437517447 |
9 | 34332703024 |
10 | 12155002663 |
11 | 5178200451 |
12 | 2432829087 |
13 | 11b92c578b |
14 | 83444999d |
15 | 4b218c40d |
hex | 2d47e9f27 |
12155002663 has 4 divisors (see below), whose sum is σ = 12225262968. Its totient is φ = 12084742360.
The previous prime is 12155002627. The next prime is 12155002693. The reversal of 12155002663 is 36620055121.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 36620055121 = 13 ⋅2816927317.
It is a cyclic number.
It is not a de Polignac number, because 12155002663 - 29 = 12155002151 is a prime.
It is a Smith number, since the sum of its digits (31) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12155002693) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 35129893 + ... + 35130238.
It is an arithmetic number, because the mean of its divisors is an integer number (3056315742).
Almost surely, 212155002663 is an apocalyptic number.
12155002663 is a deficient number, since it is larger than the sum of its proper divisors (70260305).
12155002663 is an equidigital number, since it uses as much as digits as its factorization.
12155002663 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 70260304.
The product of its (nonzero) digits is 10800, while the sum is 31.
Adding to 12155002663 its reverse (36620055121), we get a palindrome (48775057784).
The spelling of 12155002663 in words is "twelve billion, one hundred fifty-five million, two thousand, six hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •