Base | Representation |
---|---|
bin | 1101101100111111000110… |
… | …11010110000000010110000 |
3 | 10221200200120100101202210021 |
4 | 12312133203122300002300 |
5 | 12422144401310201000 |
6 | 144030525243013224 |
7 | 6230016050413315 |
oct | 666374332600260 |
9 | 127620510352707 |
10 | 30133011022000 |
11 | 966837a179617 |
12 | 3467b9050a214 |
13 | 13a76b90870b3 |
14 | 7626346cad0c |
15 | 373c6715c11a |
hex | 1b67e36b00b0 |
30133011022000 has 160 divisors (see below), whose sum is σ = 76035460026240. Its totient is φ = 11528250905600.
The previous prime is 30133011021983. The next prime is 30133011022027. The reversal of 30133011022000 is 22011033103.
It is a Harshad number since it is a multiple of its sum of digits (16).
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1150584906 + ... + 1150611094.
It is an arithmetic number, because the mean of its divisors is an integer number (475221625164).
Almost surely, 230133011022000 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 30133011022000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (38017730013120).
30133011022000 is an abundant number, since it is smaller than the sum of its proper divisors (45902449004240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30133011022000 is a wasteful number, since it uses less digits than its factorization.
30133011022000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 51248 (or 51232 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 30133011022000 its reverse (22011033103), we get a palindrome (30155022055103).
The spelling of 30133011022000 in words is "thirty trillion, one hundred thirty-three billion, eleven million, twenty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •