Base | Representation |
---|---|
bin | 10110010110110001… |
… | …10000111011010100 |
3 | 1010222110020222222002 |
4 | 23023120300323110 |
5 | 144040030420200 |
6 | 5302544454432 |
7 | 603266012345 |
oct | 131330607324 |
9 | 33873228862 |
10 | 12002201300 |
11 | 50a9a25531 |
12 | 23ab61a418 |
13 | 119375577b |
14 | 81c0320cc |
15 | 4a3a57bd5 |
hex | 2cb630ed4 |
12002201300 has 18 divisors (see below), whose sum is σ = 26044777038. Its totient is φ = 4800880480.
The previous prime is 12002201291. The next prime is 12002201317. The reversal of 12002201300 is 310220021.
It is a happy number.
12002201300 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 3 ways, for example, as 369715984 + 11632485316 = 19228^2 + 107854^2 .
It is a congruent number.
It is an unprimeable number.
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 5 ways as a sum of consecutive naturals, for example, 60010907 + ... + 60011106.
Almost surely, 212002201300 is an apocalyptic number.
12002201300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12002201300 is an abundant number, since it is smaller than the sum of its proper divisors (14042575738).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12002201300 is a wasteful number, since it uses less digits than its factorization.
12002201300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 120022027 (or 120022020 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 11.
Adding to 12002201300 its reverse (310220021), we get a palindrome (12312421321).
The spelling of 12002201300 in words is "twelve billion, two million, two hundred one thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •