Base | Representation |
---|---|
bin | 10110101000110011… |
… | …00010101110001011 |
3 | 1011100222202200212110 |
4 | 23110121202232023 |
5 | 144342232301303 |
6 | 5325545313403 |
7 | 610113124440 |
oct | 132431425613 |
9 | 34328680773 |
10 | 12153400203 |
11 | 51773064aa |
12 | 2432195863 |
13 | 11b8b84289 |
14 | 83414d9c7 |
15 | 4b1e72703 |
hex | 2d4662b8b |
12153400203 has 16 divisors (see below), whose sum is σ = 18534216960. Its totient is φ = 6939268896.
The previous prime is 12153400199. The next prime is 12153400223. The reversal of 12153400203 is 30200435121.
12153400203 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 12153400203 - 22 = 12153400199 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a self number, because there is not a number n which added to its sum of digits gives 12153400203.
It is not an unprimeable number, because it can be changed into a prime (12153400223) 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 15 ways as a sum of consecutive naturals, for example, 203400 + ... + 256277.
It is an arithmetic number, because the mean of its divisors is an integer number (1158388560).
Almost surely, 212153400203 is an apocalyptic number.
12153400203 is a deficient number, since it is larger than the sum of its proper divisors (6380816757).
12153400203 is a wasteful number, since it uses less digits than its factorization.
12153400203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 460946.
The product of its (nonzero) digits is 720, while the sum is 21.
Adding to 12153400203 its reverse (30200435121), we get a palindrome (42353835324).
The spelling of 12153400203 in words is "twelve billion, one hundred fifty-three million, four hundred thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •