Base | Representation |
---|---|
bin | 101111000010010111… |
… | …0110000000001001111 |
3 | 100122201122012022201001 |
4 | 1132010232300001033 |
5 | 3123332320030011 |
6 | 114223122201131 |
7 | 10204102101115 |
oct | 1360456600117 |
9 | 318648168631 |
10 | 101011095631 |
11 | 39925148226 |
12 | 176b04b31a7 |
13 | 96aa133094 |
14 | 4c63459ab5 |
15 | 2962dad7c1 |
hex | 1784bb004f |
101011095631 has 8 divisors (see below), whose sum is σ = 102798091520. Its totient is φ = 99232316568.
The previous prime is 101011095541. The next prime is 101011095643. The reversal of 101011095631 is 136590110101.
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 101011095631 - 215 = 101011062863 is a prime.
It is a super-2 number, since 2×1010110956312 (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 101011095631.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101011095131) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 2029401 + ... + 2078578.
It is an arithmetic number, because the mean of its divisors is an integer number (12849761440).
Almost surely, 2101011095631 is an apocalyptic number.
101011095631 is a deficient number, since it is larger than the sum of its proper divisors (1786995889).
101011095631 is an equidigital number, since it uses as much as digits as its factorization.
101011095631 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4108413.
The product of its (nonzero) digits is 810, while the sum is 28.
The spelling of 101011095631 in words is "one hundred one billion, eleven million, ninety-five thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •