Base | Representation |
---|---|
bin | 1010000000010110001000… |
… | …0010000000110110000001 |
3 | 1102221200122111120222122011 |
4 | 2200011202002000312001 |
5 | 2420220130310034334 |
6 | 35221452040012521 |
7 | 2213541264421444 |
oct | 240054202006601 |
9 | 42850574528564 |
10 | 11001055939969 |
11 | 3561581310277 |
12 | 12980b3461141 |
13 | 61a51a1191c4 |
14 | 2a064d8c565b |
15 | 14126923a564 |
hex | a0162080d81 |
11001055939969 has 2 divisors, whose sum is σ = 11001055939970. Its totient is φ = 11001055939968.
The previous prime is 11001055939891. The next prime is 11001055940053. The reversal of 11001055939969 is 96993955010011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9583079879025 + 1417976060944 = 3095655^2 + 1190788^2 .
It is a cyclic number.
It is not a de Polignac number, because 11001055939969 - 243 = 2204962917761 is a prime.
It is a super-2 number, since 2×110010559399692 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (11001055939169) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5500527969984 + 5500527969985.
It is an arithmetic number, because the mean of its divisors is an integer number (5500527969985).
Almost surely, 211001055939969 is an apocalyptic number.
It is an amenable number.
11001055939969 is a deficient number, since it is larger than the sum of its proper divisors (1).
11001055939969 is an equidigital number, since it uses as much as digits as its factorization.
11001055939969 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2952450, while the sum is 58.
The spelling of 11001055939969 in words is "eleven trillion, one billion, fifty-five million, nine hundred thirty-nine thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •