Base | Representation |
---|---|
bin | 11100111000110000000… |
… | …00000000000000000001 |
3 | 10111212220211022011112011 |
4 | 32130120000000000001 |
5 | 112230210231123221 |
6 | 2035544442532521 |
7 | 131465032431154 |
oct | 16343000000001 |
9 | 3455824264464 |
10 | 992540098561 |
11 | 352a300125a0 |
12 | 14043b807141 |
13 | 7279990a18b |
14 | 360797b1c9b |
15 | 1ac418a51e1 |
hex | e718000001 |
992540098561 has 8 divisors (see below), whose sum is σ = 1082870840448. Its totient is φ = 902225994000.
The previous prime is 992540098547. The next prime is 992540098631. The reversal of 992540098561 is 165890045299.
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 992540098561 - 29 = 992540098049 is a prime.
It is a super-3 number, since 3×9925400985613 (a number of 37 digits) contains 333 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 992540098496 and 992540098505.
It is not an unprimeable number, because it can be changed into a prime (992540098541) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4034425 + ... + 4273366.
It is an arithmetic number, because the mean of its divisors is an integer number (135358855056).
It is a Proth number, since it is equal to 7395 ⋅ 227 + 1 and 7395 < 227.
Almost surely, 2992540098561 is an apocalyptic number.
It is an amenable number.
992540098561 is a deficient number, since it is larger than the sum of its proper divisors (90330741887).
992540098561 is a wasteful number, since it uses less digits than its factorization.
992540098561 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8318663.
The product of its (nonzero) digits is 6998400, while the sum is 58.
The spelling of 992540098561 in words is "nine hundred ninety-two billion, five hundred forty million, ninety-eight thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •