Base | Representation |
---|---|
bin | 101111010100110110… |
… | …0000001000101100101 |
3 | 100201022211220122022220 |
4 | 1132221230001011211 |
5 | 3131120032323401 |
6 | 114404431542553 |
7 | 10225341255225 |
oct | 1365154010545 |
9 | 321284818286 |
10 | 101631136101 |
11 | 3a113143870 |
12 | 1784408aa59 |
13 | 9778727631 |
14 | 4cc193c085 |
15 | 299c539336 |
hex | 17a9b01165 |
101631136101 has 16 divisors (see below), whose sum is σ = 148293453888. Its totient is φ = 61400316800.
The previous prime is 101631136067. The next prime is 101631136129.
101631136101 is nontrivially palindromic in base 10.
It is a cyclic number.
It is not a de Polignac number, because 101631136101 - 27 = 101631135973 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101631136141) 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 15 ways as a sum of consecutive naturals, for example, 4847160 + ... + 4868081.
It is an arithmetic number, because the mean of its divisors is an integer number (9268340868).
Almost surely, 2101631136101 is an apocalyptic number.
101631136101 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
101631136101 is a deficient number, since it is larger than the sum of its proper divisors (46662317787).
101631136101 is a wasteful number, since it uses less digits than its factorization.
101631136101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9715572.
The product of its (nonzero) digits is 324, while the sum is 24.
It can be divided in two parts, 101631 and 136101, that added together give a palindrome (237732).
The spelling of 101631136101 in words is "one hundred one billion, six hundred thirty-one million, one hundred thirty-six thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •