Base | Representation |
---|---|
bin | 10010001111111011… |
… | …00110001100011101 |
3 | 221021210021120211110 |
4 | 21013331212030131 |
5 | 130031044423112 |
6 | 4300101212233 |
7 | 464533241232 |
oct | 110775461435 |
9 | 27253246743 |
10 | 9797264157 |
11 | 417833362a |
12 | 1a95101079 |
13 | c019b5b35 |
14 | 68d26b789 |
15 | 3c51b313c |
hex | 247f6631d |
9797264157 has 8 divisors (see below), whose sum is σ = 13063797184. Its totient is φ = 6531120288.
The previous prime is 9797264123. The next prime is 9797264159. The reversal of 9797264157 is 7514627979.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 9797264157 - 212 = 9797260061 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 9797264097 and 9797264106.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (9797264159) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 32353 + ... + 143670.
It is an arithmetic number, because the mean of its divisors is an integer number (1632974648).
Almost surely, 29797264157 is an apocalyptic number.
It is an amenable number.
9797264157 is a deficient number, since it is larger than the sum of its proper divisors (3266533027).
9797264157 is a wasteful number, since it uses less digits than its factorization.
9797264157 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 194579.
The product of its digits is 6667920, while the sum is 57.
The square root of 9797264157 is about 98981.1303077511. The cubic root of 9797264157 is about 2139.7758053339.
The spelling of 9797264157 in words is "nine billion, seven hundred ninety-seven million, two hundred sixty-four thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •