Base | Representation |
---|---|
bin | 11101011001011111101… |
… | …10011000100011111101 |
3 | 10120120022000011202222000 |
4 | 32230233312120203331 |
5 | 113022211221200333 |
6 | 2052013123212513 |
7 | 132656501120016 |
oct | 16545766304375 |
9 | 3516260152860 |
10 | 1010120100093 |
11 | 35a43150a985 |
12 | 143927217139 |
13 | 7433bb16650 |
14 | 36c6651000d |
15 | 1b41ee49713 |
hex | eb2fd988fd |
1010120100093 has 16 divisors (see below), whose sum is σ = 1611587624640. Its totient is φ = 621612369072.
The previous prime is 1010120100079. The next prime is 1010120100109. The reversal of 1010120100093 is 3900010210101.
It is not a de Polignac number, because 1010120100093 - 25 = 1010120100061 is a prime.
It is a super-2 number, since 2×10101201000932 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1010120100593) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1438917171 + ... + 1438917872.
It is an arithmetic number, because the mean of its divisors is an integer number (100724226540).
Almost surely, 21010120100093 is an apocalyptic number.
1010120100093 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
1010120100093 is a deficient number, since it is larger than the sum of its proper divisors (601467524547).
1010120100093 is a wasteful number, since it uses less digits than its factorization.
1010120100093 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2877835065 (or 2877835059 counting only the distinct ones).
The product of its (nonzero) digits is 54, while the sum is 18.
Adding to 1010120100093 its reverse (3900010210101), we get a palindrome (4910130310194).
The spelling of 1010120100093 in words is "one trillion, ten billion, one hundred twenty million, one hundred thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •