Base | Representation |
---|---|
bin | 1010111010100000010101… |
… | …1101101101101000001011 |
3 | 1120111012200200102120020102 |
4 | 2232220011131231220023 |
5 | 3033102432424101141 |
6 | 41304455114120015 |
7 | 2345662615355411 |
oct | 256500535555013 |
9 | 46435620376212 |
10 | 12000230300171 |
11 | 39072a6182823 |
12 | 1419884a2000b |
13 | 690803325689 |
14 | 2d6b5840b2b1 |
15 | 15c24826299b |
hex | aea0576da0b |
12000230300171 has 2 divisors, whose sum is σ = 12000230300172. Its totient is φ = 12000230300170.
The previous prime is 12000230300129. The next prime is 12000230300173. The reversal of 12000230300171 is 17100303200021.
12000230300171 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is an emirp because it is prime and its reverse (17100303200021) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12000230300171 is a prime.
Together with 12000230300173, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (12000230300173) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6000115150085 + 6000115150086.
It is an arithmetic number, because the mean of its divisors is an integer number (6000115150086).
Almost surely, 212000230300171 is an apocalyptic number.
12000230300171 is a deficient number, since it is larger than the sum of its proper divisors (1).
12000230300171 is an equidigital number, since it uses as much as digits as its factorization.
12000230300171 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 252, while the sum is 20.
Adding to 12000230300171 its reverse (17100303200021), we get a palindrome (29100533500192).
The spelling of 12000230300171 in words is "twelve trillion, two hundred thirty million, three hundred thousand, one hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •