Base | Representation |
---|---|
bin | 11100011111010010100… |
… | …010000111110111101001 |
3 | 20221011021102111021002121 |
4 | 130133102202013313221 |
5 | 224033424010431134 |
6 | 4055212511231241 |
7 | 261304451545504 |
oct | 34372242076751 |
9 | 6834242437077 |
10 | 1957742280169 |
11 | 69530152a495 |
12 | 27750bb18521 |
13 | 1127ca821320 |
14 | 6aa804dc13b |
15 | 35dd31c6ab4 |
hex | 1c7d2887de9 |
1957742280169 has 8 divisors (see below), whose sum is σ = 2108363765760. Its totient is φ = 1807124498256.
The previous prime is 1957742280167. The next prime is 1957742280187. The reversal of 1957742280169 is 9610822477591.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1957742280169 - 21 = 1957742280167 is a prime.
It is a super-2 number, since 2×19577422801692 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1957742280161) 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 7 ways as a sum of consecutive naturals, for example, 224922 + ... + 1991500.
It is an arithmetic number, because the mean of its divisors is an integer number (263545470720).
Almost surely, 21957742280169 is an apocalyptic number.
It is an amenable number.
1957742280169 is a deficient number, since it is larger than the sum of its proper divisors (150621485591).
1957742280169 is a wasteful number, since it uses less digits than its factorization.
1957742280169 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1851839.
The product of its (nonzero) digits is 15240960, while the sum is 61.
The spelling of 1957742280169 in words is "one trillion, nine hundred fifty-seven billion, seven hundred forty-two million, two hundred eighty thousand, one hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •