Base | Representation |
---|---|
bin | 11110000001001000101… |
… | …10111011100111111000 |
3 | 10122121020012002112100202 |
4 | 33000210112323213320 |
5 | 113344302422022300 |
6 | 2105453011221332 |
7 | 134342051362013 |
oct | 17004426734770 |
9 | 3577205075322 |
10 | 1031402142200 |
11 | 368462691131 |
12 | 147a865a7848 |
13 | 76350cac481 |
14 | 37cc4ba037a |
15 | 1bc68509ad5 |
hex | f0245bb9f8 |
1031402142200 has 48 divisors (see below), whose sum is σ = 2502271295280. Its totient is φ = 394623426560.
The previous prime is 1031402142167. The next prime is 1031402142209. The reversal of 1031402142200 is 22412041301.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1031402142209) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 112104329 + ... + 112113528.
It is an arithmetic number, because the mean of its divisors is an integer number (52130651985).
Almost surely, 21031402142200 is an apocalyptic number.
1031402142200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1031402142200 is an abundant number, since it is smaller than the sum of its proper divisors (1470869153080).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1031402142200 is a wasteful number, since it uses less digits than its factorization.
1031402142200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 224217896 (or 224217887 counting only the distinct ones).
The product of its (nonzero) digits is 384, while the sum is 20.
Adding to 1031402142200 its reverse (22412041301), we get a palindrome (1053814183501).
The spelling of 1031402142200 in words is "one trillion, thirty-one billion, four hundred two million, one hundred forty-two thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •