Base | Representation |
---|---|
bin | 10110101000111000… |
… | …11011000110101001 |
3 | 1011101001012001211221 |
4 | 23110130123012221 |
5 | 144342430433213 |
6 | 5330013422041 |
7 | 610122421330 |
oct | 132434330651 |
9 | 34331161757 |
10 | 12154155433 |
11 | 5177781962 |
12 | 243249a921 |
13 | 11b9089c64 |
14 | 8342a8d17 |
15 | 4b207138d |
hex | 2d471b1a9 |
12154155433 has 4 divisors (see below), whose sum is σ = 13890463360. Its totient is φ = 10417847508.
The previous prime is 12154155383. The next prime is 12154155449. The reversal of 12154155433 is 33455145121.
12154155433 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, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12154155433 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12154155133) 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 3 ways as a sum of consecutive naturals, for example, 868153953 + ... + 868153966.
It is an arithmetic number, because the mean of its divisors is an integer number (3472615840).
Almost surely, 212154155433 is an apocalyptic number.
It is an amenable number.
12154155433 is a deficient number, since it is larger than the sum of its proper divisors (1736307927).
12154155433 is an equidigital number, since it uses as much as digits as its factorization.
12154155433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1736307926.
The product of its digits is 36000, while the sum is 34.
The spelling of 12154155433 in words is "twelve billion, one hundred fifty-four million, one hundred fifty-five thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •