Base | Representation |
---|---|
bin | 101111010011010110… |
… | …1001101010001001111 |
3 | 100201012100210101022220 |
4 | 1132212231031101033 |
5 | 3131014231211440 |
6 | 114355443510423 |
7 | 10224163146405 |
oct | 1364655152117 |
9 | 321170711286 |
10 | 101581116495 |
11 | 3a09798a351 |
12 | 1782b388413 |
13 | 976b263331 |
14 | 4cb903b475 |
15 | 2997e588d0 |
hex | 17a6b4d44f |
101581116495 has 8 divisors (see below), whose sum is σ = 162529786416. Its totient is φ = 54176595456.
The previous prime is 101581116491. The next prime is 101581116499. The reversal of 101581116495 is 594611185101.
It is an interprime number because it is at equal distance from previous prime (101581116491) and next prime (101581116499).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 101581116495 - 22 = 101581116491 is a prime.
It is a super-2 number, since 2×1015811164952 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101581116491) 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, 3386037202 + ... + 3386037231.
It is an arithmetic number, because the mean of its divisors is an integer number (20316223302).
Almost surely, 2101581116495 is an apocalyptic number.
101581116495 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
101581116495 is a deficient number, since it is larger than the sum of its proper divisors (60948669921).
101581116495 is an equidigital number, since it uses as much as digits as its factorization.
101581116495 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6772074441.
The product of its (nonzero) digits is 43200, while the sum is 42.
The spelling of 101581116495 in words is "one hundred one billion, five hundred eighty-one million, one hundred sixteen thousand, four hundred ninety-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •