Base | Representation |
---|---|
bin | 1011010100111101100000100… |
… | …1100000110000101110001000 |
3 | 10212112022022112100110020211010 |
4 | 2311033120021200300232020 |
5 | 1313434214212323012002 |
6 | 11503144043255403520 |
7 | 326616541613351346 |
oct | 26517301140605610 |
9 | 3775268470406733 |
10 | 797103140047752 |
11 | 210a885a8136aaa |
12 | 75497b189835a0 |
13 | 282a0671485865 |
14 | 100b9dd807a996 |
15 | 622473675c46c |
hex | 2d4f609830b88 |
797103140047752 has 64 divisors (see below), whose sum is σ = 1993671092911680. Its totient is φ = 265579285036032.
The previous prime is 797103140047751. The next prime is 797103140047759. The reversal of 797103140047752 is 257740041301797.
It is a super-2 number, since 2×7971031400477522 (a number of 31 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 797103140047692 and 797103140047701.
It is not an unprimeable number, because it can be changed into a prime (797103140047751) 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, 4992017388 + ... + 4992177060.
It is an arithmetic number, because the mean of its divisors is an integer number (31151110826745).
Almost surely, 2797103140047752 is an apocalyptic number.
It is an amenable number.
797103140047752 is an abundant number, since it is smaller than the sum of its proper divisors (1196567952863928).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
797103140047752 is a wasteful number, since it uses less digits than its factorization.
797103140047752 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 253702 (or 253698 counting only the distinct ones).
The product of its (nonzero) digits is 10372320, while the sum is 57.
The spelling of 797103140047752 in words is "seven hundred ninety-seven trillion, one hundred three billion, one hundred forty million, forty-seven thousand, seven hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •