Base | Representation |
---|---|
bin | 10000000101001010011… |
… | …000101000101001011001 |
3 | 10220122100011010101010222 |
4 | 100011022120220221121 |
5 | 121101122432121001 |
6 | 2203353254245425 |
7 | 142560165560330 |
oct | 20051230505131 |
9 | 3818304111128 |
10 | 1105054567001 |
11 | 396718548aa0 |
12 | 15a200656875 |
13 | 8028b030c18 |
14 | 3b6b08d0d17 |
15 | 1db295d561b |
hex | 1014a628a59 |
1105054567001 has 32 divisors (see below), whose sum is σ = 1408136970240. Its totient is φ = 842268369600.
The previous prime is 1105054566989. The next prime is 1105054567007. The reversal of 1105054567001 is 1007654505011.
It is not a de Polignac number, because 1105054567001 - 214 = 1105054550617 is a prime.
It is a super-2 number, since 2×11050545670012 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1105054567007) 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, 101486 + ... + 1490103.
It is an arithmetic number, because the mean of its divisors is an integer number (44004280320).
Almost surely, 21105054567001 is an apocalyptic number.
1105054567001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1105054567001 is a deficient number, since it is larger than the sum of its proper divisors (303082403239).
1105054567001 is a wasteful number, since it uses less digits than its factorization.
1105054567001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1591805.
The product of its (nonzero) digits is 21000, while the sum is 35.
The spelling of 1105054567001 in words is "one trillion, one hundred five billion, fifty-four million, five hundred sixty-seven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •