Base | Representation |
---|---|
bin | 11000010001010011… |
… | …00011000100000100 |
3 | 1020122002021011000012 |
4 | 30020221203010010 |
5 | 203141140324030 |
6 | 5552542205352 |
7 | 640616160446 |
oct | 141051430404 |
9 | 36562234005 |
10 | 13030011140 |
11 | 5587113253 |
12 | 2637883858 |
13 | 12c867ba83 |
14 | 8b873c496 |
15 | 513dce095 |
hex | 308a63104 |
13030011140 has 96 divisors (see below), whose sum is σ = 30221399040. Its totient is φ = 4699814400.
The previous prime is 13030011139. The next prime is 13030011167. The reversal of 13030011140 is 4111003031.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 709514 + ... + 727646.
It is an arithmetic number, because the mean of its divisors is an integer number (314806240).
Almost surely, 213030011140 is an apocalyptic number.
13030011140 is a gapful number since it is divisible by the number (10) 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 13030011140, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15110699520).
13030011140 is an abundant number, since it is smaller than the sum of its proper divisors (17191387900).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13030011140 is a wasteful number, since it uses less digits than its factorization.
13030011140 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18253 (or 18251 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 13030011140 its reverse (4111003031), we get a palindrome (17141014171).
The spelling of 13030011140 in words is "thirteen billion, thirty million, eleven thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •