Base | Representation |
---|---|
bin | 11000101100101101… |
… | …11000110000101100 |
3 | 1021020010000210211020 |
4 | 30112112320300230 |
5 | 204124030002200 |
6 | 10031435454140 |
7 | 646411100001 |
oct | 142626706054 |
9 | 37203023736 |
10 | 13260000300 |
11 | 5694a19538 |
12 | 26a08b7350 |
13 | 1334206131 |
14 | 8db0c98a8 |
15 | 5291adea0 |
hex | 3165b8c2c |
13260000300 has 144 divisors (see below), whose sum is σ = 39335315712. Its totient is φ = 3446956800.
The previous prime is 13260000239. The next prime is 13260000329. The reversal of 13260000300 is 300006231.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 13260000300.
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, 12860785 + ... + 12861815.
Almost surely, 213260000300 is an apocalyptic number.
13260000300 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 13260000300, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (19667657856).
13260000300 is an abundant number, since it is smaller than the sum of its proper divisors (26075315412).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13260000300 is a wasteful number, since it uses less digits than its factorization.
13260000300 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2088 (or 2081 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 15.
Adding to 13260000300 its reverse (300006231), we get a palindrome (13560006531).
The spelling of 13260000300 in words is "thirteen billion, two hundred sixty million, three hundred", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •