Base | Representation |
---|---|
bin | 1101101111000010101001… |
… | …10100101110101001111001 |
3 | 10221221102212010100210011111 |
4 | 12313201110310232221321 |
5 | 12424324020040243301 |
6 | 144123205120000321 |
7 | 6235066120436212 |
oct | 667412464565171 |
9 | 127842763323144 |
10 | 30203633134201 |
11 | 969531a5517aa |
12 | 34797bb7600a1 |
13 | 13b126236cc77 |
14 | 765c13ba4409 |
15 | 3759ec1a7551 |
hex | 1b7854d2ea79 |
30203633134201 has 4 divisors (see below), whose sum is σ = 30245640969600. Its totient is φ = 30161625298804.
The previous prime is 30203633134177. The next prime is 30203633134211. The reversal of 30203633134201 is 10243133630203.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 30203633134201 - 221 = 30203631037049 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (30203633134211) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 21003916621 + ... + 21003918058.
It is an arithmetic number, because the mean of its divisors is an integer number (7561410242400).
Almost surely, 230203633134201 is an apocalyptic number.
It is an amenable number.
30203633134201 is a deficient number, since it is larger than the sum of its proper divisors (42007835399).
30203633134201 is an equidigital number, since it uses as much as digits as its factorization.
30203633134201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42007835398.
The product of its (nonzero) digits is 23328, while the sum is 31.
Adding to 30203633134201 its reverse (10243133630203), we get a palindrome (40446766764404).
The spelling of 30203633134201 in words is "thirty trillion, two hundred three billion, six hundred thirty-three million, one hundred thirty-four thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •