Base | Representation |
---|---|
bin | 11111111001101101110… |
… | …11010001110010001111 |
3 | 10212210022202100110012000 |
4 | 33330312323101302033 |
5 | 120424342332410422 |
6 | 2155320421043343 |
7 | 142123216465314 |
oct | 17746673216217 |
9 | 3783282313160 |
10 | 1096138169487 |
11 | 392962469629 |
12 | 158532556553 |
13 | 7c4999a296a |
14 | 3b0a663cd0b |
15 | 1d7a691ecac |
hex | ff36ed1c8f |
1096138169487 has 16 divisors (see below), whose sum is σ = 1628508720480. Its totient is φ = 728688635136.
The previous prime is 1096138169471. The next prime is 1096138169507. The reversal of 1096138169487 is 7849618316901.
1096138169487 is a `hidden beast` number, since 1 + 0 + 9 + 6 + 13 + 81 + 69 + 487 = 666.
It is not a de Polignac number, because 1096138169487 - 24 = 1096138169471 is a prime.
It is a super-2 number, since 2×10961381694872 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1096138269487) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 57494308 + ... + 57513369.
It is an arithmetic number, because the mean of its divisors is an integer number (101781795030).
Almost surely, 21096138169487 is an apocalyptic number.
1096138169487 is a deficient number, since it is larger than the sum of its proper divisors (532370550993).
1096138169487 is a wasteful number, since it uses less digits than its factorization.
1096138169487 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 115008039 (or 115008033 counting only the distinct ones).
The product of its (nonzero) digits is 15676416, while the sum is 63.
It can be divided in two parts, 1096138 and 169487, that added together give a square (1265625 = 11252).
The spelling of 1096138169487 in words is "one trillion, ninety-six billion, one hundred thirty-eight million, one hundred sixty-nine thousand, four hundred eighty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •