Base | Representation |
---|---|
bin | 1101110001110110011001… |
… | …00110110011101000101101 |
3 | 10222021122221022001122202001 |
4 | 12320323030212303220231 |
5 | 12432414132244443041 |
6 | 144235404414132301 |
7 | 6245053342511626 |
oct | 670731446635055 |
9 | 128248838048661 |
10 | 30300132031021 |
11 | 97222396771a6 |
12 | 3494450ab1091 |
13 | 13ba3a0717c08 |
14 | 76a769c5aa4d |
15 | 378298d68131 |
hex | 1b8ecc9b3a2d |
30300132031021 has 8 divisors (see below), whose sum is σ = 31630503089664. Its totient is φ = 28970842140240.
The previous prime is 30300132031003. The next prime is 30300132031031. The reversal of 30300132031021 is 12013023100303.
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 30300132031021 - 27 = 30300132030893 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 30300132031021.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30300132031031) 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, 270234685 + ... + 270346786.
It is an arithmetic number, because the mean of its divisors is an integer number (3953812886208).
Almost surely, 230300132031021 is an apocalyptic number.
It is an amenable number.
30300132031021 is a deficient number, since it is larger than the sum of its proper divisors (1330371058643).
30300132031021 is a wasteful number, since it uses less digits than its factorization.
30300132031021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 540583931.
The product of its (nonzero) digits is 324, while the sum is 19.
Adding to 30300132031021 its reverse (12013023100303), we get a palindrome (42313155131324).
The spelling of 30300132031021 in words is "thirty trillion, three hundred billion, one hundred thirty-two million, thirty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •