Base | Representation |
---|---|
bin | 1101101100000101100100… |
… | …01111110110101110010001 |
3 | 10221120201211120221212112101 |
4 | 12312002302033312232101 |
5 | 12421143121023423441 |
6 | 144004420145200401 |
7 | 6224543425251226 |
oct | 666026217665621 |
9 | 127521746855471 |
10 | 30102121311121 |
11 | 96562687a0642 |
12 | 3461bab630101 |
13 | 13a480558b972 |
14 | 760d4404394d |
15 | 37305a38a231 |
hex | 1b60b23f6b91 |
30102121311121 has 8 divisors (see below), whose sum is σ = 30230169830784. Its totient is φ = 29974098770880.
The previous prime is 30102121311107. The next prime is 30102121311133. The reversal of 30102121311121 is 12111312120103.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 30102121311121 - 27 = 30102121310993 is a prime.
It is a super-2 number, since 2×301021213111212 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (30102121311221) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4170781 + ... + 8809066.
It is an arithmetic number, because the mean of its divisors is an integer number (3778771228848).
Almost surely, 230102121311121 is an apocalyptic number.
It is an amenable number.
30102121311121 is a deficient number, since it is larger than the sum of its proper divisors (128048519663).
30102121311121 is a wasteful number, since it uses less digits than its factorization.
30102121311121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12989711.
The product of its (nonzero) digits is 72, while the sum is 19.
Adding to 30102121311121 its reverse (12111312120103), we get a palindrome (42213433431224).
The spelling of 30102121311121 in words is "thirty trillion, one hundred two billion, one hundred twenty-one million, three hundred eleven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •