Base | Representation |
---|---|
bin | 1101101110111101110001… |
… | …00010111000101101111101 |
3 | 10221221012002101202021212201 |
4 | 12313132320202320231331 |
5 | 12424303132332224013 |
6 | 144122053015031501 |
7 | 6234644132446510 |
oct | 667367042705575 |
9 | 127835071667781 |
10 | 30201011211133 |
11 | 96941a4543134 |
12 | 34791a966b591 |
13 | 13b0c350c24b9 |
14 | 765a45896d77 |
15 | 3758e6de63dd |
hex | 1b77b88b8b7d |
30201011211133 has 8 divisors (see below), whose sum is σ = 34515527677568. Its totient is φ = 25886516318064.
The previous prime is 30201011211127. The next prime is 30201011211179. The reversal of 30201011211133 is 33111211010203.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-30201011211133 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 30201011211133.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30201011211433) 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, 2273166 + ... + 8097487.
It is an arithmetic number, because the mean of its divisors is an integer number (4314440959696).
Almost surely, 230201011211133 is an apocalyptic number.
It is an amenable number.
30201011211133 is a deficient number, since it is larger than the sum of its proper divisors (4314516466435).
30201011211133 is a wasteful number, since it uses less digits than its factorization.
30201011211133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10786683.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 30201011211133 its reverse (33111211010203), we get a palindrome (63312222221336).
The spelling of 30201011211133 in words is "thirty trillion, two hundred one billion, eleven million, two hundred eleven thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •