Base | Representation |
---|---|
bin | 10000000001011010100… |
… | …000100001000100111111 |
3 | 10220020221200101100002011 |
4 | 100001122200201010333 |
5 | 121014402201220221 |
6 | 2201450052112051 |
7 | 142355360305240 |
oct | 20013240410477 |
9 | 3806850340064 |
10 | 1101030101311 |
11 | 394a42874398 |
12 | 159478905627 |
13 | 7ca9932458a |
14 | 3b40c20ccc7 |
15 | 1d99112b1e1 |
hex | 1005a82113f |
1101030101311 has 8 divisors (see below), whose sum is σ = 1258471477280. Its totient is φ = 943626565728.
The previous prime is 1101030101291. The next prime is 1101030101323. The reversal of 1101030101311 is 1131010301011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1101030101311 - 27 = 1101030101183 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1101030101291 and 1101030101300.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1101030101341) 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, 9397716 + ... + 9514153.
It is an arithmetic number, because the mean of its divisors is an integer number (157308934660).
Almost surely, 21101030101311 is an apocalyptic number.
1101030101311 is a deficient number, since it is larger than the sum of its proper divisors (157441375969).
1101030101311 is an equidigital number, since it uses as much as digits as its factorization.
1101030101311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18920193.
The product of its (nonzero) digits is 9, while the sum is 13.
Adding to 1101030101311 its reverse (1131010301011), we get a palindrome (2232040402322).
The spelling of 1101030101311 in words is "one trillion, one hundred one billion, thirty million, one hundred one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •