Base | Representation |
---|---|
bin | 111010010100101… |
… | …0010000111010101 |
3 | 12001101101211201112 |
4 | 1310221102013111 |
5 | 13001441313112 |
6 | 522104504405 |
7 | 66332022410 |
oct | 16451220725 |
9 | 5041354645 |
10 | 1956979157 |
11 | 914733451 |
12 | 46747b105 |
13 | 252593843 |
14 | 147c9ab77 |
15 | b6c15a22 |
hex | 74a521d5 |
1956979157 has 16 divisors (see below), whose sum is σ = 2492749440. Its totient is φ = 1495646208.
The previous prime is 1956979153. The next prime is 1956979163. The reversal of 1956979157 is 7519796591.
It is not a de Polignac number, because 1956979157 - 22 = 1956979153 is a prime.
It is a Smith number, since the sum of its digits (59) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a junction number, because it is equal to n+sod(n) for n = 1956979096 and 1956979105.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1956979151) 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, 430508 + ... + 435029.
It is an arithmetic number, because the mean of its divisors is an integer number (155796840).
Almost surely, 21956979157 is an apocalyptic number.
1956979157 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
It is an amenable number.
1956979157 is a deficient number, since it is larger than the sum of its proper divisors (535770283).
1956979157 is a wasteful number, since it uses less digits than its factorization.
1956979157 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 865580.
The product of its digits is 5358150, while the sum is 59.
The square root of 1956979157 is about 44237.7571425135. The cubic root of 1956979157 is about 1250.8216799153.
The spelling of 1956979157 in words is "one billion, nine hundred fifty-six million, nine hundred seventy-nine thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •