Base | Representation |
---|---|
bin | 1001000011011110000… |
… | …00101101010101101000 |
3 | 1002202000002201122002201 |
4 | 10201233000231111220 |
5 | 20044113111230432 |
6 | 354530054505544 |
7 | 31322231143621 |
oct | 4415700552550 |
9 | 1082002648081 |
10 | 311100101992 |
11 | 10aa33996209 |
12 | 503629652b4 |
13 | 2344b7042b4 |
14 | 110b342ca48 |
15 | 815be22ee7 |
hex | 486f02d568 |
311100101992 has 16 divisors (see below), whose sum is σ = 592875195300. Its totient is φ = 153000049920.
The previous prime is 311100101989. The next prime is 311100102031. The reversal of 311100101992 is 299101001113.
It can be written as a sum of positive squares in 2 ways, for example, as 196066526436 + 115033575556 = 442794^2 + 339166^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 311100101992.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 318749617 + ... + 318750592.
Almost surely, 2311100101992 is an apocalyptic number.
It is an amenable number.
311100101992 is a deficient number, since it is larger than the sum of its proper divisors (281775093308).
311100101992 is a wasteful number, since it uses less digits than its factorization.
311100101992 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 637500276 (or 637500272 counting only the distinct ones).
The product of its (nonzero) digits is 486, while the sum is 28.
The spelling of 311100101992 in words is "three hundred eleven billion, one hundred million, one hundred one thousand, nine hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •