Base | Representation |
---|---|
bin | 11101011001011111110… |
… | …10001111000111110001 |
3 | 10120120022002002002022000 |
4 | 32230233322033013301 |
5 | 113022212001010001 |
6 | 2052013201004213 |
7 | 132656512524243 |
oct | 16545772170761 |
9 | 3516262062260 |
10 | 1010121110001 |
11 | 35a43203a713 |
12 | 143927623669 |
13 | 7433c0ab223 |
14 | 36c666d4093 |
15 | 1b420098a86 |
hex | eb2fe8f1f1 |
1010121110001 has 32 divisors (see below), whose sum is σ = 1503361536000. Its totient is φ = 670317805584.
The previous prime is 1010121109997. The next prime is 1010121110071. The reversal of 1010121110001 is 1000111210101.
It is not a de Polignac number, because 1010121110001 - 22 = 1010121109997 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is not an unprimeable number, because it can be changed into a prime (1010121110071) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 16120590 + ... + 16183128.
It is an arithmetic number, because the mean of its divisors is an integer number (46980048000).
Almost surely, 21010121110001 is an apocalyptic number.
It is an amenable number.
1010121110001 is a deficient number, since it is larger than the sum of its proper divisors (493240425999).
1010121110001 is a wasteful number, since it uses less digits than its factorization.
1010121110001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 65290 (or 65284 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 1010121110001 its reverse (1000111210101), we get a palindrome (2010232320102).
The spelling of 1010121110001 in words is "one trillion, ten billion, one hundred twenty-one million, one hundred ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •