Base | Representation |
---|---|
bin | 10110010110101001… |
… | …00110111111100001 |
3 | 1010222101012122202212 |
4 | 23023110212333201 |
5 | 144034241041113 |
6 | 5302505251505 |
7 | 603253524551 |
oct | 131324467741 |
9 | 33871178685 |
10 | 12001112033 |
11 | 50a9351109 |
12 | 23ab193b95 |
13 | 1193463a31 |
14 | 81bc2b161 |
15 | 4a38e00a8 |
hex | 2cb526fe1 |
12001112033 has 4 divisors (see below), whose sum is σ = 12003102720. Its totient is φ = 11999121348.
The previous prime is 12001111981. The next prime is 12001112051. The reversal of 12001112033 is 33021110021.
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 not a de Polignac number, because 12001112033 - 228 = 11732676577 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12001111999 and 12001112017.
It is not an unprimeable number, because it can be changed into a prime (12001112083) 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, 986273 + ... + 998366.
It is an arithmetic number, because the mean of its divisors is an integer number (3000775680).
Almost surely, 212001112033 is an apocalyptic number.
It is an amenable number.
12001112033 is a deficient number, since it is larger than the sum of its proper divisors (1990687).
12001112033 is an equidigital number, since it uses as much as digits as its factorization.
12001112033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1990686.
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 12001112033 its reverse (33021110021), we get a palindrome (45022222054).
The spelling of 12001112033 in words is "twelve billion, one million, one hundred twelve thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •