Base | Representation |
---|---|
bin | 10111001101010101110… |
… | …11100011001100011011 |
3 | 2211020022201210221202222 |
4 | 23212222323203030123 |
5 | 101031122242442011 |
6 | 1410200511414255 |
7 | 111420140000450 |
oct | 13465273431433 |
9 | 2736281727688 |
10 | 797436687131 |
11 | 288211247907 |
12 | 10a66bb2438b |
13 | 5a275bb03b6 |
14 | 2a84bb53827 |
15 | 15b2325bddb |
hex | b9aaee331b |
797436687131 has 32 divisors (see below), whose sum is σ = 944616038400. Its totient is φ = 658758263040.
The previous prime is 797436687101. The next prime is 797436687143. The reversal of 797436687131 is 131786634797.
It is a cyclic number.
It is not a de Polignac number, because 797436687131 - 214 = 797436670747 is a prime.
It is a super-2 number, since 2×7974366871312 (a number of 25 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (62) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (797436687101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 63017201 + ... + 63029853.
It is an arithmetic number, because the mean of its divisors is an integer number (29519251200).
Almost surely, 2797436687131 is an apocalyptic number.
797436687131 is a deficient number, since it is larger than the sum of its proper divisors (147179351269).
797436687131 is a wasteful number, since it uses less digits than its factorization.
797436687131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13859.
The product of its digits is 32006016, while the sum is 62.
The spelling of 797436687131 in words is "seven hundred ninety-seven billion, four hundred thirty-six million, six hundred eighty-seven thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •