Base | Representation |
---|---|
bin | 11000001101111101… |
… | …01100011100000100 |
3 | 1020120010120001010110 |
4 | 30012332230130010 |
5 | 203112003001012 |
6 | 5550101553020 |
7 | 640126114632 |
oct | 140676543404 |
9 | 36503501113 |
10 | 13002000132 |
11 | 5572321160 |
12 | 262a415770 |
13 | 12c2922204 |
14 | 8b4b2a352 |
15 | 5116e973c |
hex | 306fac704 |
13002000132 has 96 divisors (see below), whose sum is σ = 33576850944. Its totient is φ = 3882995200.
The previous prime is 13002000113. The next prime is 13002000149. The reversal of 13002000132 is 23100020031.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (12).
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, 5378188 + ... + 5380604.
It is an arithmetic number, because the mean of its divisors is an integer number (349758864).
Almost surely, 213002000132 is an apocalyptic number.
13002000132 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 13002000132, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16788425472).
13002000132 is an abundant number, since it is smaller than the sum of its proper divisors (20574850812).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13002000132 is a wasteful number, since it uses less digits than its factorization.
13002000132 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3009 (or 3007 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 12.
Adding to 13002000132 its reverse (23100020031), we get a palindrome (36102020163).
The spelling of 13002000132 in words is "thirteen billion, two million, one hundred thirty-two", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •