Base | Representation |
---|---|
bin | 101100000101111010110… |
… | …010100001111010111011 |
3 | 101201122222202011100200101 |
4 | 230011322302201322323 |
5 | 344120431033311141 |
6 | 10235545053020231 |
7 | 431624344064026 |
oct | 54057262417273 |
9 | 11648882140611 |
10 | 3030012010171 |
11 | a69025873173 |
12 | 40b2a0a84677 |
13 | 18c96253b7c3 |
14 | a6920b8a1bd |
15 | 53c3e441531 |
hex | 2c17aca1ebb |
3030012010171 has 2 divisors, whose sum is σ = 3030012010172. Its totient is φ = 3030012010170.
The previous prime is 3030012010147. The next prime is 3030012010211. The reversal of 3030012010171 is 1710102100303.
3030012010171 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 3030012010171 - 27 = 3030012010043 is a prime.
It is a super-3 number, since 3×30300120101713 (a number of 38 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (3030012010141) 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, 1515006005085 + 1515006005086.
It is an arithmetic number, because the mean of its divisors is an integer number (1515006005086).
Almost surely, 23030012010171 is an apocalyptic number.
3030012010171 is a deficient number, since it is larger than the sum of its proper divisors (1).
3030012010171 is an equidigital number, since it uses as much as digits as its factorization.
3030012010171 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 126, while the sum is 19.
Adding to 3030012010171 its reverse (1710102100303), we get a palindrome (4740114110474).
The spelling of 3030012010171 in words is "three trillion, thirty billion, twelve million, ten thousand, one hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •