Base | Representation |
---|---|
bin | 10110100110010111… |
… | …10110000001001101 |
3 | 1011022120102212222001 |
4 | 23103023312001031 |
5 | 144322024011023 |
6 | 5323540552301 |
7 | 606445033114 |
oct | 132313660115 |
9 | 34276385861 |
10 | 12133032013 |
11 | 5166864593 |
12 | 24273b2691 |
13 | 11b48a23ab |
14 | 83156ac7b |
15 | 4b029c6ad |
hex | 2d32f604d |
12133032013 has 8 divisors (see below), whose sum is σ = 12666519936. Its totient is φ = 11600041200.
The previous prime is 12133031993. The next prime is 12133032017. The reversal of 12133032013 is 31023033121.
12133032013 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 12133032013 - 29 = 12133031501 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12133032017) 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 7 ways as a sum of consecutive naturals, for example, 73953 + ... + 172438.
It is an arithmetic number, because the mean of its divisors is an integer number (1583314992).
Almost surely, 212133032013 is an apocalyptic number.
It is an amenable number.
12133032013 is a deficient number, since it is larger than the sum of its proper divisors (533487923).
12133032013 is a wasteful number, since it uses less digits than its factorization.
12133032013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 248555.
The product of its (nonzero) digits is 324, while the sum is 19.
Adding to 12133032013 its reverse (31023033121), we get a palindrome (43156065134).
The spelling of 12133032013 in words is "twelve billion, one hundred thirty-three million, thirty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •