Base | Representation |
---|---|
bin | 11111111011011101101… |
… | …01001001101001100100 |
3 | 10212212202010012121200100 |
4 | 33331232311021221210 |
5 | 120433302434244041 |
6 | 2155553443544100 |
7 | 142155365611002 |
oct | 17755665115144 |
9 | 3785663177610 |
10 | 1097076087396 |
11 | 3932a393a1a3 |
12 | 15875468b030 |
13 | 7c5b90b4283 |
14 | 3b155029a72 |
15 | 1d80de3b6b6 |
hex | ff6ed49a64 |
1097076087396 has 27 divisors (see below), whose sum is σ = 2773180440121. Its totient is φ = 365689934304.
The previous prime is 1097076087311. The next prime is 1097076087431. The reversal of 1097076087396 is 6937806707901.
The square root of 1097076087396 is 1047414.
It is a perfect power (a square), and thus also a powerful number.
1097076087396 is a `hidden beast` number, since 10 + 9 + 7 + 0 + 7 + 608 + 7 + 3 + 9 + 6 = 666.
It can be written as a sum of positive squares in only one way, i.e., 576254064996 + 520822022400 = 759114^2 + 721680^2 .
It is a super-2 number, since 2×10970760873962 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 6197200 + ... + 6371768.
Almost surely, 21097076087396 is an apocalyptic number.
1097076087396 is the 1047414-th square number.
It is an amenable number.
1097076087396 is an abundant number, since it is smaller than the sum of its proper divisors (1676104352725).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1097076087396 is an frugal number, since it uses more digits than its factorization.
1097076087396 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 349148 (or 174574 counting only the distinct ones).
The product of its (nonzero) digits is 24004512, while the sum is 63.
The spelling of 1097076087396 in words is "one trillion, ninety-seven billion, seventy-six million, eighty-seven thousand, three hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.116 sec. • engine limits •