Base | Representation |
---|---|
bin | 11000010000000110… |
… | …10111101010111000 |
3 | 1020121101102200102100 |
4 | 30020003113222320 |
5 | 203131110044000 |
6 | 5551543503400 |
7 | 640435125264 |
oct | 141003275270 |
9 | 36541380370 |
10 | 13020003000 |
11 | 55814a7a64 |
12 | 2634457b60 |
13 | 12c65865b4 |
14 | 8b72950a4 |
15 | 5130a3a00 |
hex | 3080d7ab8 |
13020003000 has 192 divisors, whose sum is σ = 44199043200. Its totient is φ = 3456902400.
The previous prime is 13020002977. The next prime is 13020003011. The reversal of 13020003000 is 30002031.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 2147974 + ... + 2154026.
It is an arithmetic number, because the mean of its divisors is an integer number (230203350).
Almost surely, 213020003000 is an apocalyptic number.
13020003000 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 13020003000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (22099521600).
13020003000 is an abundant number, since it is smaller than the sum of its proper divisors (31179040200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13020003000 is a wasteful number, since it uses less digits than its factorization.
13020003000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6319 (or 6302 counting only the distinct ones).
The product of its (nonzero) digits is 18, while the sum is 9.
Adding to 13020003000 its reverse (30002031), we get a palindrome (13050005031).
The spelling of 13020003000 in words is "thirteen billion, twenty million, three thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •