Base | Representation |
---|---|
bin | 1001001011111001110011… |
… | …1100000101100100011000 |
3 | 1022202120010102010111222101 |
4 | 2102332130330011210120 |
5 | 2310440001341010130 |
6 | 33251531123133144 |
7 | 2061464630630254 |
oct | 222763474054430 |
9 | 38676112114871 |
10 | 10100101110040 |
11 | 3244479849637 |
12 | 11715735141b4 |
13 | 5835878a9a96 |
14 | 26cbc178d264 |
15 | 127ad7ea11ca |
hex | 92f9cf05918 |
10100101110040 has 32 divisors (see below), whose sum is σ = 22732050141360. Its totient is φ = 4038827529600.
The previous prime is 10100101110017. The next prime is 10100101110041. The reversal of 10100101110040 is 4001110100101.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a junction number, because it is equal to n+sod(n) for n = 10100101109999 and 10100101110026.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10100101110041) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 37768671 + ... + 38035150.
Almost surely, 210100101110040 is an apocalyptic number.
10100101110040 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10100101110040 is an abundant number, since it is smaller than the sum of its proper divisors (12631949031320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10100101110040 is a wasteful number, since it uses less digits than its factorization.
10100101110040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 75807163 (or 75807159 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 10100101110040 its reverse (4001110100101), we get a palindrome (14101211210141).
The spelling of 10100101110040 in words is "ten trillion, one hundred billion, one hundred one million, one hundred ten thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.690 sec. • engine limits •