Base | Representation |
---|---|
bin | 1100001000000001100100… |
… | …1001000110001110110000 |
3 | 1202012112020000122022212222 |
4 | 3002000121021012032300 |
5 | 3221412414034131000 |
6 | 44204345243140212 |
7 | 2544130252533122 |
oct | 302003111061660 |
9 | 52175200568788 |
10 | 13332000302000 |
11 | 4280084673576 |
12 | 15b39b7b14668 |
13 | 759282400a63 |
14 | 3413b5109212 |
15 | 181be1391a85 |
hex | c20192463b0 |
13332000302000 has 80 divisors (see below), whose sum is σ = 32765248779744. Its totient is φ = 5245377120000.
The previous prime is 13332000301973. The next prime is 13332000302003. The reversal of 13332000302000 is 20300023331.
It is a tau number, because it is divible by the number of its divisors (80).
It is a self number, because there is not a number n which added to its sum of digits gives 13332000302000.
It is not an unprimeable number, because it can be changed into a prime (13332000302003) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 54517346 + ... + 54761345.
Almost surely, 213332000302000 is an apocalyptic number.
13332000302000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13332000302000 is an abundant number, since it is smaller than the sum of its proper divisors (19433248477744).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13332000302000 is a wasteful number, since it uses less digits than its factorization.
13332000302000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 109278775 (or 109278759 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 17.
Adding to 13332000302000 its reverse (20300023331), we get a palindrome (13352300325331).
The spelling of 13332000302000 in words is "thirteen trillion, three hundred thirty-two billion, three hundred two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •