Base | Representation |
---|---|
bin | 101111001101001001… |
… | …1110101111010010111 |
3 | 100200122212110010002010 |
4 | 1132122103311322113 |
5 | 3130103011000011 |
6 | 114323054115303 |
7 | 10216056322650 |
oct | 1363223657227 |
9 | 320585403063 |
10 | 101373140631 |
11 | 39aa0549a74 |
12 | 177917abb33 |
13 | 97371458a9 |
14 | 4c99580527 |
15 | 2984a761a6 |
hex | 179a4f5e97 |
101373140631 has 32 divisors (see below), whose sum is σ = 159951375360. Its totient is φ = 55877036544.
The previous prime is 101373140611. The next prime is 101373140653. The reversal of 101373140631 is 136041373101.
It is not a de Polignac number, because 101373140631 - 217 = 101373009559 is a prime.
It is a super-2 number, since 2×1013731406312 (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 (101373140611) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 569071 + ... + 725663.
It is an arithmetic number, because the mean of its divisors is an integer number (4998480480).
Almost surely, 2101373140631 is an apocalyptic number.
101373140631 is a deficient number, since it is larger than the sum of its proper divisors (58578234729).
101373140631 is a wasteful number, since it uses less digits than its factorization.
101373140631 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 157695.
The product of its (nonzero) digits is 4536, while the sum is 30.
The spelling of 101373140631 in words is "one hundred one billion, three hundred seventy-three million, one hundred forty thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •