Base | Representation |
---|---|
bin | 1101101100111001101101… |
… | …00000010110100010010110 |
3 | 10221200102002011200012200000 |
4 | 12312130312200112202112 |
5 | 12422122431132011042 |
6 | 144025325332432130 |
7 | 6226554133410510 |
oct | 666346640264226 |
9 | 127612064605600 |
10 | 30130110032022 |
11 | 9667120693940 |
12 | 3467500a78646 |
13 | 13a734605a890 |
14 | 76243b2d8bb0 |
15 | 373b4762474c |
hex | 1b6736816896 |
30130110032022 has 192 divisors, whose sum is σ = 90897572473344. Its totient is φ = 7224002288640.
The previous prime is 30130110032003. The next prime is 30130110032059. The reversal of 30130110032022 is 22023001103103.
30130110032022 is a `hidden beast` number, since 30 + 1 + 301 + 10 + 0 + 320 + 2 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 30130110031986 and 30130110032004.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 30480603 + ... + 31453574.
It is an arithmetic number, because the mean of its divisors is an integer number (473424856632).
Almost surely, 230130110032022 is an apocalyptic number.
30130110032022 is an abundant number, since it is smaller than the sum of its proper divisors (60767462441322).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30130110032022 is a wasteful number, since it uses less digits than its factorization.
30130110032022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 61934225 (or 61934213 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 30130110032022 its reverse (22023001103103), we get a palindrome (52153111135125).
The spelling of 30130110032022 in words is "thirty trillion, one hundred thirty billion, one hundred ten million, thirty-two thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •