Base | Representation |
---|---|
bin | 1101101001101101001101… |
… | …01101001101001100011001 |
3 | 10221021220200221120101010102 |
4 | 12310312212231031030121 |
5 | 12413323110231100441 |
6 | 143503051322025145 |
7 | 6215616411525110 |
oct | 664664655151431 |
9 | 127256627511112 |
10 | 30020323300121 |
11 | 9624602969260 |
12 | 344a1816481b5 |
13 | 1399b9aab221b |
14 | 75adc458cc77 |
15 | 370d6e10769b |
hex | 1b4da6b4d319 |
30020323300121 has 16 divisors (see below), whose sum is σ = 37472545797120. Its totient is φ = 23364578305680.
The previous prime is 30020323300057. The next prime is 30020323300129. The reversal of 30020323300121 is 12100332302003.
It is a cyclic number.
It is not a de Polignac number, because 30020323300121 - 26 = 30020323300057 is a prime.
It is a super-2 number, since 2×300203233001212 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 30020323300093 and 30020323300102.
It is not an unprimeable number, because it can be changed into a prime (30020323300129) 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, 232280051 + ... + 232409256.
It is an arithmetic number, because the mean of its divisors is an integer number (2342034112320).
Almost surely, 230020323300121 is an apocalyptic number.
It is an amenable number.
30020323300121 is a deficient number, since it is larger than the sum of its proper divisors (7452222496999).
30020323300121 is a wasteful number, since it uses less digits than its factorization.
30020323300121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 464690164.
The product of its (nonzero) digits is 648, while the sum is 20.
Adding to 30020323300121 its reverse (12100332302003), we get a palindrome (42120655602124).
The spelling of 30020323300121 in words is "thirty trillion, twenty billion, three hundred twenty-three million, three hundred thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •