Base | Representation |
---|---|
bin | 10000011000000111010… |
… | …000100000101011001000 |
3 | 10222120212021200001020102 |
4 | 100120013100200223020 |
5 | 121414311204401300 |
6 | 2221000400144532 |
7 | 144210353236466 |
oct | 20300720405310 |
9 | 3876767601212 |
10 | 1125403200200 |
11 | 3a430a849324 |
12 | 16213b308148 |
13 | 82181a03896 |
14 | 3c681209836 |
15 | 1e41ac6a0d5 |
hex | 10607420ac8 |
1125403200200 has 48 divisors (see below), whose sum is σ = 2629844575380. Its totient is φ = 447876181760.
The previous prime is 1125403200193. The next prime is 1125403200269. The reversal of 1125403200200 is 20023045211.
It can be written as a sum of positive squares in 6 ways, for example, as 1059874368004 + 65528832196 = 1029502^2 + 255986^2 .
It is a Harshad number since it is a multiple of its sum of digits (20).
It is an unprimeable number.
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, 14242367 + ... + 14321166.
Almost surely, 21125403200200 is an apocalyptic number.
1125403200200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1125403200200 is an abundant number, since it is smaller than the sum of its proper divisors (1504441375180).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1125403200200 is a wasteful number, since it uses less digits than its factorization.
1125403200200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28563746 (or 28563737 counting only the distinct ones).
The product of its (nonzero) digits is 480, while the sum is 20.
Adding to 1125403200200 its reverse (20023045211), we get a palindrome (1145426245411).
The spelling of 1125403200200 in words is "one trillion, one hundred twenty-five billion, four hundred three million, two hundred thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •