Base | Representation |
---|---|
bin | 11101011001101001001… |
… | …11100110101101110000 |
3 | 10120120111120201210122101 |
4 | 32230310213212231300 |
5 | 113022342212040414 |
6 | 2052025102150144 |
7 | 132661462162600 |
oct | 16546447465560 |
9 | 3516446653571 |
10 | 1010200111984 |
11 | 35a47269a008 |
12 | 143949b82354 |
13 | 7435257c26b |
14 | 36c72dbac00 |
15 | 1b426ea1a74 |
hex | eb349e6b70 |
1010200111984 has 60 divisors (see below), whose sum is σ = 2302398172800. Its totient is φ = 428078348544.
The previous prime is 1010200111981. The next prime is 1010200112087. The reversal of 1010200111984 is 4891110020101.
It is a super-2 number, since 2×10102001119842 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (28).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1010200111981) 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, 7169104 + ... + 7308655.
It is an arithmetic number, because the mean of its divisors is an integer number (38373302880).
Almost surely, 21010200111984 is an apocalyptic number.
1010200111984 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
1010200111984 is an abundant number, since it is smaller than the sum of its proper divisors (1292198060816).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1010200111984 is a wasteful number, since it uses less digits than its factorization.
1010200111984 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14477870 (or 14477857 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 28.
The spelling of 1010200111984 in words is "one trillion, ten billion, two hundred million, one hundred eleven thousand, nine hundred eighty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •