Base | Representation |
---|---|
bin | 11101011001010001100… |
… | …01010001100101110111 |
3 | 10120112222201200010201211 |
4 | 32230220301101211313 |
5 | 113021440314222221 |
6 | 2051553241302251 |
7 | 132653526400204 |
oct | 16545061214567 |
9 | 3515881603654 |
10 | 1010001320311 |
11 | 35a380461975 |
12 | 1438b3494987 |
13 | 74320328c59 |
14 | 36c54830cab |
15 | 1b4147d56e1 |
hex | eb28c51977 |
1010001320311 has 4 divisors (see below), whose sum is σ = 1017267517000. Its totient is φ = 1002735123624.
The previous prime is 1010001320267. The next prime is 1010001320323. The reversal of 1010001320311 is 1130231000101.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1010001320311 - 27 = 1010001320183 is a prime.
It is a super-2 number, since 2×10100013203112 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1010001320291 and 1010001320300.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1010001320611) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3633098136 + ... + 3633098413.
It is an arithmetic number, because the mean of its divisors is an integer number (254316879250).
Almost surely, 21010001320311 is an apocalyptic number.
1010001320311 is a deficient number, since it is larger than the sum of its proper divisors (7266196689).
1010001320311 is an equidigital number, since it uses as much as digits as its factorization.
1010001320311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7266196688.
The product of its (nonzero) digits is 18, while the sum is 13.
Adding to 1010001320311 its reverse (1130231000101), we get a palindrome (2140232320412).
The spelling of 1010001320311 in words is "one trillion, ten billion, one million, three hundred twenty thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •