Base | Representation |
---|---|
bin | 11101011001010001101… |
… | …01001000110111000000 |
3 | 10120112222210120121001021 |
4 | 32230220311020313000 |
5 | 113021441044124440 |
6 | 2051553315115224 |
7 | 132653541116044 |
oct | 16545065106700 |
9 | 3515883517037 |
10 | 1010002333120 |
11 | 35a380a93900 |
12 | 1438b38a2b14 |
13 | 743205c1c51 |
14 | 36c54a16024 |
15 | 1b41493584a |
hex | eb28d48dc0 |
1010002333120 has 84 divisors (see below), whose sum is σ = 2643587303112. Its totient is φ = 367273561600.
The previous prime is 1010002333097. The next prime is 1010002333177. The reversal of 1010002333120 is 213332000101.
It is a Harshad number since it is a multiple of its sum of digits (16).
It is a junction number, because it is equal to n+sod(n) for n = 1010002333094 and 1010002333103.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 13003666 + ... + 13081105.
It is an arithmetic number, because the mean of its divisors is an integer number (31471277418).
Almost surely, 21010002333120 is an apocalyptic number.
1010002333120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1010002333120 is an abundant number, since it is smaller than the sum of its proper divisors (1633584969992).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1010002333120 is a wasteful number, since it uses less digits than its factorization.
1010002333120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 26084810 (or 26084789 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 1010002333120 its reverse (213332000101), we get a palindrome (1223334333221).
The spelling of 1010002333120 in words is "one trillion, ten billion, two million, three hundred thirty-three thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •