Base | Representation |
---|---|
bin | 10011010111100110101… |
… | …111110111001110010001 |
3 | 11201020120210210201110020 |
4 | 103113212233313032101 |
5 | 133301410121413410 |
6 | 2455243240254053 |
7 | 165106552015563 |
oct | 23274657671621 |
9 | 4636523721406 |
10 | 1331016201105 |
11 | 473531a45148 |
12 | 195b62771329 |
13 | 9868bb7c966 |
14 | 485c895b333 |
15 | 24951d80a70 |
hex | 135e6bf7391 |
1331016201105 has 32 divisors (see below), whose sum is σ = 2132264193408. Its totient is φ = 708996288000.
The previous prime is 1331016201077. The next prime is 1331016201161. The reversal of 1331016201105 is 5011026101331.
It is not a de Polignac number, because 1331016201105 - 219 = 1331015676817 is a prime.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 66470995 + ... + 66491015.
It is an arithmetic number, because the mean of its divisors is an integer number (66633256044).
Almost surely, 21331016201105 is an apocalyptic number.
1331016201105 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1331016201105 is a deficient number, since it is larger than the sum of its proper divisors (801247992303).
1331016201105 is a wasteful number, since it uses less digits than its factorization.
1331016201105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25297.
The product of its (nonzero) digits is 540, while the sum is 24.
The spelling of 1331016201105 in words is "one trillion, three hundred thirty-one billion, sixteen million, two hundred one thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •