Base | Representation |
---|---|
bin | 1101101001000111110001… |
… | …00010001010110100010001 |
3 | 10221012222211000010001210201 |
4 | 12310203320202022310101 |
5 | 12413010423123131113 |
6 | 143445524510255201 |
7 | 6214305310414513 |
oct | 664437042126421 |
9 | 127188730101721 |
10 | 30000221302033 |
11 | 96170279035a4 |
12 | 34462b14b7501 |
13 | 13980162444b8 |
14 | 75a038915bb3 |
15 | 37059443ecdd |
hex | 1b48f888ad11 |
30000221302033 has 8 divisors (see below), whose sum is σ = 30410556871968. Its totient is φ = 29592292392864.
The previous prime is 30000221302013. The next prime is 30000221302063. The reversal of 30000221302033 is 33020312200003.
It is a happy number.
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 30000221302033 - 25 = 30000221302001 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 30000221302033.
It is not an unprimeable number, because it can be changed into a prime (30000221302013) 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, 601640091 + ... + 601689952.
It is an arithmetic number, because the mean of its divisors is an integer number (3801319608996).
Almost surely, 230000221302033 is an apocalyptic number.
It is an amenable number.
30000221302033 is a deficient number, since it is larger than the sum of its proper divisors (410335569935).
30000221302033 is a wasteful number, since it uses less digits than its factorization.
30000221302033 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1203330383.
The product of its (nonzero) digits is 648, while the sum is 19.
Adding to 30000221302033 its reverse (33020312200003), we get a palindrome (63020533502036).
The spelling of 30000221302033 in words is "thirty trillion, two hundred twenty-one million, three hundred two thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •