Base | Representation |
---|---|
bin | 10000000000011101001… |
… | …011001000111111001001 |
3 | 10220011021222010000102001 |
4 | 100000131023020333021 |
5 | 121010300234244213 |
6 | 2201200012511001 |
7 | 142321023653623 |
oct | 20003513107711 |
9 | 3804258100361 |
10 | 1100001087433 |
11 | 394564a33aa6 |
12 | 15923017b461 |
13 | 7c964099221 |
14 | 3b3516abc13 |
15 | 1d930b181dd |
hex | 1001d2c8fc9 |
1100001087433 has 2 divisors, whose sum is σ = 1100001087434. Its totient is φ = 1100001087432.
The previous prime is 1100001087401. The next prime is 1100001087443. The reversal of 1100001087433 is 3347801000011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1080179826489 + 19821260944 = 1039317^2 + 140788^2 .
It is a cyclic number.
It is not a de Polignac number, because 1100001087433 - 25 = 1100001087401 is a prime.
It is not a weakly prime, because it can be changed into another prime (1100001087443) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 550000543716 + 550000543717.
It is an arithmetic number, because the mean of its divisors is an integer number (550000543717).
Almost surely, 21100001087433 is an apocalyptic number.
It is an amenable number.
1100001087433 is a deficient number, since it is larger than the sum of its proper divisors (1).
1100001087433 is an equidigital number, since it uses as much as digits as its factorization.
1100001087433 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2016, while the sum is 28.
Adding to 1100001087433 its reverse (3347801000011), we get a palindrome (4447802087444).
The spelling of 1100001087433 in words is "one trillion, one hundred billion, one million, eighty-seven thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •