Base | Representation |
---|---|
bin | 10000000101001010001… |
… | …011000100001110110001 |
3 | 10220122022220102122211001 |
4 | 100011022023010032301 |
5 | 121101121024304334 |
6 | 2203353050122001 |
7 | 142560123414064 |
oct | 20051213041661 |
9 | 3818286378731 |
10 | 1105051009969 |
11 | 3967165395a5 |
12 | 15a1bb420301 |
13 | 8028a386b7a |
14 | 3b6b02468db |
15 | 1db29131714 |
hex | 1014a2c43b1 |
1105051009969 has 2 divisors, whose sum is σ = 1105051009970. Its totient is φ = 1105051009968.
The previous prime is 1105051009961. The next prime is 1105051010071. The reversal of 1105051009969 is 9699001505011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 871819966369 + 233231043600 = 933713^2 + 482940^2 .
It is a cyclic number.
It is not a de Polignac number, because 1105051009969 - 23 = 1105051009961 is a prime.
It is a super-2 number, since 2×11050510099692 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1105051009961) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 552525504984 + 552525504985.
It is an arithmetic number, because the mean of its divisors is an integer number (552525504985).
Almost surely, 21105051009969 is an apocalyptic number.
It is an amenable number.
1105051009969 is a deficient number, since it is larger than the sum of its proper divisors (1).
1105051009969 is an equidigital number, since it uses as much as digits as its factorization.
1105051009969 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 109350, while the sum is 46.
The spelling of 1105051009969 in words is "one trillion, one hundred five billion, fifty-one million, nine thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •