Base | Representation |
---|---|
bin | 10110100110001111… |
… | …11101010010110001 |
3 | 1011022111112010110110 |
4 | 23103013331102301 |
5 | 144321243410413 |
6 | 5323503051533 |
7 | 606433260654 |
oct | 132307752261 |
9 | 34274463413 |
10 | 12132013233 |
11 | 516622911a |
12 | 2426ba0ba9 |
13 | 11b4606772 |
14 | 83138389b |
15 | 4b014a8c3 |
hex | 2d31fd4b1 |
12132013233 has 4 divisors (see below), whose sum is σ = 16176017648. Its totient is φ = 8088008820.
The previous prime is 12132013219. The next prime is 12132013241. The reversal of 12132013233 is 33231023121.
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 de Polignac number, because none of the positive numbers 2k-12132013233 is a prime.
It is a super-2 number, since 2×121320132332 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12132013253) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2022002203 + ... + 2022002208.
It is an arithmetic number, because the mean of its divisors is an integer number (4044004412).
Almost surely, 212132013233 is an apocalyptic number.
It is an amenable number.
12132013233 is a deficient number, since it is larger than the sum of its proper divisors (4044004415).
12132013233 is an equidigital number, since it uses as much as digits as its factorization.
12132013233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4044004414.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 12132013233 its reverse (33231023121), we get a palindrome (45363036354).
The spelling of 12132013233 in words is "twelve billion, one hundred thirty-two million, thirteen thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •