Base | Representation |
---|---|
bin | 11000110010101011… |
… | …01000011110011100 |
3 | 1021100121010012202210 |
4 | 30121111220132130 |
5 | 204224330044400 |
6 | 10040423320420 |
7 | 650556105522 |
oct | 143125503634 |
9 | 37317105683 |
10 | 13310003100 |
11 | 5710171369 |
12 | 26b55b0110 |
13 | 13416928a4 |
14 | 9039c4312 |
15 | 52d789950 |
hex | 31956879c |
13310003100 has 72 divisors (see below), whose sum is σ = 38533766320. Its totient is φ = 3547169280.
The previous prime is 13310003033. The next prime is 13310003111. The reversal of 13310003100 is 130001331.
13310003100 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×133100031002 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 513246 + ... + 538554.
Almost surely, 213310003100 is an apocalyptic number.
13310003100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13310003100 is an abundant number, since it is smaller than the sum of its proper divisors (25223763220).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13310003100 is a wasteful number, since it uses less digits than its factorization.
13310003100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27079 (or 27072 counting only the distinct ones).
The product of its (nonzero) digits is 27, while the sum is 12.
Adding to 13310003100 its reverse (130001331), we get a palindrome (13440004431).
The spelling of 13310003100 in words is "thirteen billion, three hundred ten million, three thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •