Base | Representation |
---|---|
bin | 1101110100110100100000… |
… | …10110110001101111111101 |
3 | 10222122102101121201121002120 |
4 | 12322122100112301233331 |
5 | 12441102201301124013 |
6 | 144354324505513153 |
7 | 6255325603441065 |
oct | 672322026615775 |
9 | 128572347647076 |
10 | 30402200411133 |
11 | 9761556603951 |
12 | 34b01974a27b9 |
13 | 13c6bb88c40c5 |
14 | 77168d8963a5 |
15 | 37ac6e971123 |
hex | 1ba6905b1bfd |
30402200411133 has 4 divisors (see below), whose sum is σ = 40536267214848. Its totient is φ = 20268133607420.
The previous prime is 30402200411123. The next prime is 30402200411239. The reversal of 30402200411133 is 33111400220403.
It is a happy number.
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 30402200411133 - 24 = 30402200411117 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30402200411123) 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, 5067033401853 + ... + 5067033401858.
It is an arithmetic number, because the mean of its divisors is an integer number (10134066803712).
Almost surely, 230402200411133 is an apocalyptic number.
It is an amenable number.
30402200411133 is a deficient number, since it is larger than the sum of its proper divisors (10134066803715).
30402200411133 is a wasteful number, since it uses less digits than its factorization.
30402200411133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10134066803714.
The product of its (nonzero) digits is 1728, while the sum is 24.
Adding to 30402200411133 its reverse (33111400220403), we get a palindrome (63513600631536).
The spelling of 30402200411133 in words is "thirty trillion, four hundred two billion, two hundred million, four hundred eleven thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •