Base | Representation |
---|---|
bin | 10000000000100011101… |
… | …010100110110110111111 |
3 | 10220011120120001022202012 |
4 | 100000203222212312333 |
5 | 121011011124441201 |
6 | 2201214503121435 |
7 | 142323515464643 |
oct | 20004352466677 |
9 | 3804516038665 |
10 | 1100109999551 |
11 | 394610462312 |
12 | 15926074327b |
13 | 7c980810374 |
14 | 3b361d3cc23 |
15 | 1d93a47d5bb |
hex | 10023aa6dbf |
1100109999551 has 2 divisors, whose sum is σ = 1100109999552. Its totient is φ = 1100109999550.
The previous prime is 1100109999533. The next prime is 1100109999557. The reversal of 1100109999551 is 1559999010011.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1100109999551 - 218 = 1100109737407 is a prime.
It is a super-2 number, since 2×11001099995512 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1100109999551.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1100109999557) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 550054999775 + 550054999776.
It is an arithmetic number, because the mean of its divisors is an integer number (550054999776).
Almost surely, 21100109999551 is an apocalyptic number.
1100109999551 is a deficient number, since it is larger than the sum of its proper divisors (1).
1100109999551 is an equidigital number, since it uses as much as digits as its factorization.
1100109999551 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 164025, while the sum is 50.
The spelling of 1100109999551 in words is "one trillion, one hundred billion, one hundred nine million, nine hundred ninety-nine thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.032 sec. • engine limits •