Base | Representation |
---|---|
bin | 1101101110111111101001… |
… | …10010110000000110111011 |
3 | 10221221021200211201211211101 |
4 | 12313133310302300012323 |
5 | 12424312220113100011 |
6 | 144122341203512231 |
7 | 6235011155156116 |
oct | 667376462600673 |
9 | 127837624654741 |
10 | 30202022003131 |
11 | 9694673068120 |
12 | 3479430088677 |
13 | 13b106663a884 |
14 | 765addc1357d |
15 | 375955a0a2c1 |
hex | 1b77f4cb01bb |
30202022003131 has 16 divisors (see below), whose sum is σ = 33405359270400. Its totient is φ = 27075814552800.
The previous prime is 30202022003119. The next prime is 30202022003141. The reversal of 30202022003131 is 13130022020203.
It is a cyclic number.
It is not a de Polignac number, because 30202022003131 - 215 = 30202021970363 is a prime.
It is a super-2 number, since 2×302020220031312 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 30202022003099 and 30202022003108.
It is not an unprimeable number, because it can be changed into a prime (30202022003141) 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, 20452761 + ... + 21879658.
It is an arithmetic number, because the mean of its divisors is an integer number (2087834954400).
Almost surely, 230202022003131 is an apocalyptic number.
30202022003131 is a deficient number, since it is larger than the sum of its proper divisors (3203337267269).
30202022003131 is a wasteful number, since it uses less digits than its factorization.
30202022003131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42333330.
The product of its (nonzero) digits is 432, while the sum is 19.
Adding to 30202022003131 its reverse (13130022020203), we get a palindrome (43332044023334).
The spelling of 30202022003131 in words is "thirty trillion, two hundred two billion, twenty-two million, three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •