Base | Representation |
---|---|
bin | 1101101001001001011101… |
… | …10100100101101011101101 |
3 | 10221020002011110221102012002 |
4 | 12310210232310211223231 |
5 | 12413014304304202313 |
6 | 143450155124022045 |
7 | 6214340010156242 |
oct | 664445664455355 |
9 | 127202143842162 |
10 | 30001132100333 |
11 | 9617454a40869 |
12 | 3446506531925 |
13 | 139812cb4bbc4 |
14 | 75a0c38835c9 |
15 | 3705e93a1058 |
hex | 1b492ed25aed |
30001132100333 has 4 divisors (see below), whose sum is σ = 30380893266240. Its totient is φ = 29621370934428.
The previous prime is 30001132100267. The next prime is 30001132100339. The reversal of 30001132100333 is 33300123110003.
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 30001132100333 - 242 = 25603085589229 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30001132100339) 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, 189880582835 + ... + 189880582992.
It is an arithmetic number, because the mean of its divisors is an integer number (7595223316560).
Almost surely, 230001132100333 is an apocalyptic number.
It is an amenable number.
30001132100333 is a deficient number, since it is larger than the sum of its proper divisors (379761165907).
30001132100333 is an equidigital number, since it uses as much as digits as its factorization.
30001132100333 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 379761165906.
The product of its (nonzero) digits is 486, while the sum is 20.
Adding to 30001132100333 its reverse (33300123110003), we get a palindrome (63301255210336).
The spelling of 30001132100333 in words is "thirty trillion, one billion, one hundred thirty-two million, one hundred thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •