Base | Representation |
---|---|
bin | 1101101111010000011001… |
… | …00101100001001101100100 |
3 | 10221222010220022100101202121 |
4 | 12313220030211201031210 |
5 | 12424434122321401040 |
6 | 144130425155515324 |
7 | 6235450006340611 |
oct | 667501445411544 |
9 | 127863808311677 |
10 | 30211011122020 |
11 | 96984661a71a3 |
12 | 347b11a5b8b44 |
13 | 13b1b69a7b231 |
14 | 7663139d5508 |
15 | 375ccec87c4a |
hex | 1b7a0c961364 |
30211011122020 has 48 divisors (see below), whose sum is σ = 63845182896768. Its totient is φ = 12008032951040.
The previous prime is 30211011122009. The next prime is 30211011122029. The reversal of 30211011122020 is 2022111011203.
It is a super-2 number, since 2×302110111220202 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 30211011121985 and 30211011122003.
It is not an unprimeable number, because it can be changed into a prime (30211011122029) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4313824 + ... + 8889943.
It is an arithmetic number, because the mean of its divisors is an integer number (1330107977016).
Almost surely, 230211011122020 is an apocalyptic number.
It is an amenable number.
30211011122020 is an abundant number, since it is smaller than the sum of its proper divisors (33634171774748).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30211011122020 is a wasteful number, since it uses less digits than its factorization.
30211011122020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13204500 (or 13204498 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 30211011122020 its reverse (2022111011203), we get a palindrome (32233122133223).
The spelling of 30211011122020 in words is "thirty trillion, two hundred eleven billion, eleven million, one hundred twenty-two thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •