Base | Representation |
---|---|
bin | 11000011010000010… |
… | …01111101010100000 |
3 | 1020211012020020022121 |
4 | 30031001033222200 |
5 | 203313423111000 |
6 | 10004121514024 |
7 | 642466325053 |
oct | 141501175240 |
9 | 36735206277 |
10 | 13103332000 |
11 | 5614542300 |
12 | 2658342914 |
13 | 130a910cb5 |
14 | 8c4386a9a |
15 | 51a563b1a |
hex | 30d04faa0 |
13103332000 has 144 divisors (see below), whose sum is σ = 35389075176. Its totient is φ = 4764672000.
The previous prime is 13103331971. The next prime is 13103332013. The reversal of 13103332000 is 23330131.
It can be written as a sum of positive squares in 4 ways, for example, as 3843504016 + 9259827984 = 61996^2 + 96228^2 .
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 23 ways as a sum of consecutive naturals, for example, 470464 + ... + 497536.
Almost surely, 213103332000 is an apocalyptic number.
13103332000 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 13103332000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (17694537588).
13103332000 is an abundant number, since it is smaller than the sum of its proper divisors (22285743176).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13103332000 is a wasteful number, since it uses less digits than its factorization.
13103332000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 27120 (or 27091 counting only the distinct ones).
The product of its (nonzero) digits is 162, while the sum is 16.
Adding to 13103332000 its reverse (23330131), we get a palindrome (13126662131).
The spelling of 13103332000 in words is "thirteen billion, one hundred three million, three hundred thirty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •