Base | Representation |
---|---|
bin | 1101111011010111100000… |
… | …01100000110100101111011 |
3 | 11000102221000111112011121002 |
4 | 12331223300030012211323 |
5 | 13003243344002300201 |
6 | 145045530013435215 |
7 | 6310511146035146 |
oct | 675536014064573 |
9 | 130387014464532 |
10 | 30627146525051 |
11 | 983899984671a |
12 | 35278b549bb0b |
13 | 141218723061b |
14 | 77c50cad505d |
15 | 381a37ec176b |
hex | 1bdaf030697b |
30627146525051 has 2 divisors, whose sum is σ = 30627146525052. Its totient is φ = 30627146525050.
The previous prime is 30627146524999. The next prime is 30627146525113. The reversal of 30627146525051 is 15052564172603.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 30627146525051 - 226 = 30627079416187 is a prime.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 30627146524987 and 30627146525005.
It is not a weakly prime, because it can be changed into another prime (30627146555051) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15313573262525 + 15313573262526.
It is an arithmetic number, because the mean of its divisors is an integer number (15313573262526).
Almost surely, 230627146525051 is an apocalyptic number.
30627146525051 is a deficient number, since it is larger than the sum of its proper divisors (1).
30627146525051 is an equidigital number, since it uses as much as digits as its factorization.
30627146525051 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1512000, while the sum is 47.
The spelling of 30627146525051 in words is "thirty trillion, six hundred twenty-seven billion, one hundred forty-six million, five hundred twenty-five thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •