Base | Representation |
---|---|
bin | 1010111010011111100110… |
… | …1010001000111000010101 |
3 | 1120111012011212201121022201 |
4 | 2232213321222020320111 |
5 | 3033102031222342213 |
6 | 41304423320524501 |
7 | 2345654661662155 |
oct | 256477152107025 |
9 | 46435155647281 |
10 | 12000032230933 |
11 | 390720439943a |
12 | 141982a620731 |
13 | 6907a1296146 |
14 | 2d6b39dac765 |
15 | 15c235b8a6dd |
hex | ae9f9a88e15 |
12000032230933 has 2 divisors, whose sum is σ = 12000032230934. Its totient is φ = 12000032230932.
The previous prime is 12000032230847. The next prime is 12000032230937. The reversal of 12000032230933 is 33903223000021.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11409951691044 + 590080539889 = 3377862^2 + 768167^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12000032230933 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12000032230937) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6000016115466 + 6000016115467.
It is an arithmetic number, because the mean of its divisors is an integer number (6000016115467).
Almost surely, 212000032230933 is an apocalyptic number.
It is an amenable number.
12000032230933 is a deficient number, since it is larger than the sum of its proper divisors (1).
12000032230933 is an equidigital number, since it uses as much as digits as its factorization.
12000032230933 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5832, while the sum is 28.
Adding to 12000032230933 its reverse (33903223000021), we get a palindrome (45903255230954).
The spelling of 12000032230933 in words is "twelve trillion, thirty-two million, two hundred thirty thousand, nine hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.031 sec. • engine limits •