Base | Representation |
---|---|
bin | 1101101100111111010100… |
… | …00110101100000000011110 |
3 | 10221200200212011111011022220 |
4 | 12312133222012230000132 |
5 | 12422200114014444402 |
6 | 144030544331250210 |
7 | 6230021612061033 |
oct | 666375206540036 |
9 | 127620764434286 |
10 | 30133123203102 |
11 | 966842752a977 |
12 | 3468001ba9966 |
13 | 13a77063a414a |
14 | 76264556d38a |
15 | 373c71e1adbc |
hex | 1b67ea1ac01e |
30133123203102 has 16 divisors (see below), whose sum is σ = 63811319724432. Its totient is φ = 9453528848000.
The previous prime is 30133123203101. The next prime is 30133123203121. The reversal of 30133123203102 is 20130232133103.
It is a super-2 number, since 2×301331232031022 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30133123203101) 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 7 ways as a sum of consecutive naturals, for example, 147711388149 + ... + 147711388352.
It is an arithmetic number, because the mean of its divisors is an integer number (3988207482777).
Almost surely, 230133123203102 is an apocalyptic number.
30133123203102 is an abundant number, since it is smaller than the sum of its proper divisors (33678196521330).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30133123203102 is a wasteful number, since it uses less digits than its factorization.
30133123203102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 295422776523.
The product of its (nonzero) digits is 1944, while the sum is 24.
Adding to 30133123203102 its reverse (20130232133103), we get a palindrome (50263355336205).
The spelling of 30133123203102 in words is "thirty trillion, one hundred thirty-three billion, one hundred twenty-three million, two hundred three thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •