Base | Representation |
---|---|
bin | 110110010100001101… |
… | …0111011000110000111 |
3 | 102011001222222220211210 |
4 | 1230220122323012013 |
5 | 3402340404412211 |
6 | 125330144302503 |
7 | 11266334610651 |
oct | 1545032730607 |
9 | 364058886753 |
10 | 116642263431 |
11 | 45516575a21 |
12 | 1a733311a33 |
13 | accb66b3b5 |
14 | 590741b6d1 |
15 | 307a2ea9a6 |
hex | 1b286bb187 |
116642263431 has 8 divisors (see below), whose sum is σ = 155525117824. Its totient is φ = 77760459000.
The previous prime is 116642263403. The next prime is 116642263487. The reversal of 116642263431 is 134362246611.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 116642263431 - 222 = 116638069127 is a prime.
It is a super-2 number, since 2×1166422634312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 116642263431.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (116642263531) 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, 49806 + ... + 485556.
It is an arithmetic number, because the mean of its divisors is an integer number (19440639728).
Almost surely, 2116642263431 is an apocalyptic number.
116642263431 is a deficient number, since it is larger than the sum of its proper divisors (38882854393).
116642263431 is an equidigital number, since it uses as much as digits as its factorization.
116642263431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 524981.
The product of its digits is 124416, while the sum is 39.
The spelling of 116642263431 in words is "one hundred sixteen billion, six hundred forty-two million, two hundred sixty-three thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •