Base | Representation |
---|---|
bin | 10110100110011000… |
… | …01110100001110011 |
3 | 1011022120121222200012 |
4 | 23103030032201303 |
5 | 144322040214103 |
6 | 5323543045135 |
7 | 606445631600 |
oct | 132314164163 |
9 | 34276558605 |
10 | 12133132403 |
11 | 5166922a57 |
12 | 24274407ab |
13 | 11b4908cb2 |
14 | 8315956a7 |
15 | 4b02bc2d8 |
hex | 2d330e873 |
12133132403 has 24 divisors (see below), whose sum is σ = 14224745808. Its totient is φ = 10318565376.
The previous prime is 12133132397. The next prime is 12133132409. The reversal of 12133132403 is 30423133121.
12133132403 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (12133132397) and next prime (12133132409).
It is not a de Polignac number, because 12133132403 - 210 = 12133131379 is a prime.
It is not an unprimeable number, because it can be changed into a prime (12133132409) 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 23 ways as a sum of consecutive naturals, for example, 4093400 + ... + 4096362.
It is an arithmetic number, because the mean of its divisors is an integer number (592697742).
Almost surely, 212133132403 is an apocalyptic number.
12133132403 is a deficient number, since it is larger than the sum of its proper divisors (2091613405).
12133132403 is a wasteful number, since it uses less digits than its factorization.
12133132403 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3603 (or 3596 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 12133132403 its reverse (30423133121), we get a palindrome (42556265524).
The spelling of 12133132403 in words is "twelve billion, one hundred thirty-three million, one hundred thirty-two thousand, four hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •