Base | Representation |
---|---|
bin | 11000110001011111… |
… | …10111001101110000 |
3 | 1021022220111012000101 |
4 | 30120233313031300 |
5 | 204214311231000 |
6 | 10035431202144 |
7 | 650406000403 |
oct | 143057671560 |
9 | 37286435011 |
10 | 13300102000 |
11 | 5705619539 |
12 | 26b2216354 |
13 | 133c607053 |
14 | 902567d3a |
15 | 52c980e6a |
hex | 318bf7370 |
13300102000 has 40 divisors (see below), whose sum is σ = 32159651472. Its totient is φ = 5320040000.
The previous prime is 13300101979. The next prime is 13300102021. The reversal of 13300102000 is 20100331.
It is an interprime number because it is at equal distance from previous prime (13300101979) and next prime (13300102021).
It is a tau number, because it is divible by the number of its divisors (40).
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3323026 + ... + 3327025.
Almost surely, 213300102000 is an apocalyptic number.
13300102000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13300102000 is an abundant number, since it is smaller than the sum of its proper divisors (18859549472).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13300102000 is an equidigital number, since it uses as much as digits as its factorization.
13300102000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6650074 (or 6650058 counting only the distinct ones).
The product of its (nonzero) digits is 18, while the sum is 10.
Adding to 13300102000 its reverse (20100331), we get a palindrome (13320202331).
The spelling of 13300102000 in words is "thirteen billion, three hundred million, one hundred two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •