Base | Representation |
---|---|
bin | 10110100011101010… |
… | …01000010000101000 |
3 | 1011020222122222210001 |
4 | 23101311020100220 |
5 | 144300214101300 |
6 | 5321405432344 |
7 | 606050565445 |
oct | 132165102050 |
9 | 34228588701 |
10 | 12110300200 |
11 | 5154a48869 |
12 | 241b86b6b4 |
13 | 11acc7370b |
14 | 82c5309cc |
15 | 4ad2ac16a |
hex | 2d1d48428 |
12110300200 has 48 divisors (see below), whose sum is σ = 29812717980. Its totient is φ = 4559170560.
The previous prime is 12110300159. The next prime is 12110300201. The reversal of 12110300200 is 200301121.
It can be written as a sum of positive squares in 6 ways, for example, as 9466900804 + 2643399396 = 97298^2 + 51414^2 .
It is a Harshad number since it is a multiple of its sum of digits (10).
It is not an unprimeable number, because it can be changed into a prime (12110300201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1777527 + ... + 1784326.
Almost surely, 212110300200 is an apocalyptic number.
12110300200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12110300200 is an abundant number, since it is smaller than the sum of its proper divisors (17702417780).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12110300200 is a wasteful number, since it uses less digits than its factorization.
12110300200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3561886 (or 3561877 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 10.
Adding to 12110300200 its reverse (200301121), we get a palindrome (12310601321).
The spelling of 12110300200 in words is "twelve billion, one hundred ten million, three hundred thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •