Base | Representation |
---|---|
bin | 11000110001101111… |
… | …11000001110100100 |
3 | 1021100001102221110022 |
4 | 30120313320032210 |
5 | 204220331001200 |
6 | 10035544214312 |
7 | 650432601551 |
oct | 143067701644 |
9 | 37301387408 |
10 | 13302203300 |
11 | 5706824251 |
12 | 26b2a6a398 |
13 | 133cb91619 |
14 | 902953a28 |
15 | 52cc48885 |
hex | 318df83a4 |
13302203300 has 36 divisors (see below), whose sum is σ = 28870818816. Its totient is φ = 5319952800.
The previous prime is 13302203293. The next prime is 13302203309. The reversal of 13302203300 is 330220331.
13302203300 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×133022033002 (a number of 21 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (13302203309) by changing a digit.
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 11 ways as a sum of consecutive naturals, for example, 1023845 + ... + 1036755.
Almost surely, 213302203300 is an apocalyptic number.
13302203300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13302203300 is an abundant number, since it is smaller than the sum of its proper divisors (15568615516).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13302203300 is a wasteful number, since it uses less digits than its factorization.
13302203300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23228 (or 23221 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 17.
Adding to 13302203300 its reverse (330220331), we get a palindrome (13632423631).
The spelling of 13302203300 in words is "thirteen billion, three hundred two million, two hundred three thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •