Base | Representation |
---|---|
bin | 1001001011111101010100… |
… | …0001011000101011011011 |
3 | 1022202122112222121212002101 |
4 | 2102333111001120223123 |
5 | 2310443413224220011 |
6 | 33252204334144231 |
7 | 2061530144356153 |
oct | 222772501305333 |
9 | 38678488555071 |
10 | 10101042023131 |
11 | 3244911985564 |
12 | 1171796652077 |
13 | 5836a77c97a7 |
14 | 26cc70719763 |
15 | 127b408b02c1 |
hex | 92fd5058adb |
10101042023131 has 2 divisors, whose sum is σ = 10101042023132. Its totient is φ = 10101042023130.
The previous prime is 10101042023087. The next prime is 10101042023209. The reversal of 10101042023131 is 13132024010101.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 10101042023131 - 213 = 10101042014939 is a prime.
It is a super-2 number, since 2×101010420231312 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10101042023099 and 10101042023108.
It is not a weakly prime, because it can be changed into another prime (10101042063131) 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 as a sum of consecutive naturals, namely, 5050521011565 + 5050521011566.
It is an arithmetic number, because the mean of its divisors is an integer number (5050521011566).
Almost surely, 210101042023131 is an apocalyptic number.
10101042023131 is a deficient number, since it is larger than the sum of its proper divisors (1).
10101042023131 is an equidigital number, since it uses as much as digits as its factorization.
10101042023131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 10101042023131 its reverse (13132024010101), we get a palindrome (23233066033232).
The spelling of 10101042023131 in words is "ten trillion, one hundred one billion, forty-two million, twenty-three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •