Base | Representation |
---|---|
bin | 101111011101001111… |
… | …0010000000010111111 |
3 | 100202001110210121022002 |
4 | 1132322132100002333 |
5 | 3132204130140111 |
6 | 114452411412515 |
7 | 10235330666024 |
oct | 1367236200277 |
9 | 322043717262 |
10 | 101912740031 |
11 | 3a2480a2a93 |
12 | 1790245413b |
13 | 97c1b8408b |
14 | 4d0b0c354b |
15 | 29b711263b |
hex | 17ba7900bf |
101912740031 has 8 divisors (see below), whose sum is σ = 106347479040. Its totient is φ = 97478313592.
The previous prime is 101912740021. The next prime is 101912740049. The reversal of 101912740031 is 130047219101.
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 101912740031 - 210 = 101912739007 is a prime.
It is a super-2 number, since 2×1019127400312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101912739976 and 101912740003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101912740021) 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, 796610 + ... + 915648.
It is an arithmetic number, because the mean of its divisors is an integer number (13293434880).
Almost surely, 2101912740031 is an apocalyptic number.
101912740031 is a deficient number, since it is larger than the sum of its proper divisors (4434739009).
101912740031 is a wasteful number, since it uses less digits than its factorization.
101912740031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 156285.
The product of its (nonzero) digits is 1512, while the sum is 29.
Adding to 101912740031 its reverse (130047219101), we get a palindrome (231959959132).
The spelling of 101912740031 in words is "one hundred one billion, nine hundred twelve million, seven hundred forty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •