Base | Representation |
---|---|
bin | 1101101100010110001010… |
… | …10100000111011110110001 |
3 | 10221121120211112100120100102 |
4 | 12312023011110013132301 |
5 | 12421314342432130113 |
6 | 144012452225402145 |
7 | 6225310264413530 |
oct | 666130524073661 |
9 | 127546745316312 |
10 | 30111031130033 |
11 | 965a020097447 |
12 | 3463877499355 |
13 | 13a55c5455769 |
14 | 76154b4a2317 |
15 | 3733cc6a1758 |
hex | 1b62c55077b1 |
30111031130033 has 16 divisors (see below), whose sum is σ = 37472893296000. Its totient is φ = 23607922770432.
The previous prime is 30111031129997. The next prime is 30111031130039. The reversal of 30111031130033 is 33003113011103.
It is not a de Polignac number, because 30111031130033 - 210 = 30111031129009 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 30111031129987 and 30111031130014.
It is not an unprimeable number, because it can be changed into a prime (30111031130039) 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 in 15 ways as a sum of consecutive naturals, for example, 3903422528 + ... + 3903430241.
It is an arithmetic number, because the mean of its divisors is an integer number (2342055831000).
Almost surely, 230111031130033 is an apocalyptic number.
It is an amenable number.
30111031130033 is a deficient number, since it is larger than the sum of its proper divisors (7361862165967).
30111031130033 is a wasteful number, since it uses less digits than its factorization.
30111031130033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7806852824.
The product of its (nonzero) digits is 243, while the sum is 20.
Adding to 30111031130033 its reverse (33003113011103), we get a palindrome (63114144141136).
The spelling of 30111031130033 in words is "thirty trillion, one hundred eleven billion, thirty-one million, one hundred thirty thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.168 sec. • engine limits •