Base | Representation |
---|---|
bin | 10110111111100010011011… |
… | …000111000010100100010111 |
3 | 111021001021221111122102020021 |
4 | 112333202123013002210113 |
5 | 101223301020424043111 |
6 | 555023224112250011 |
7 | 30204626643334414 |
oct | 2677423307024427 |
9 | 437037844572207 |
10 | 101123312331031 |
11 | 2a248179593551 |
12 | b412460840907 |
13 | 4456b6c907a23 |
14 | 1ad857446b10b |
15 | ba56b1bc7d71 |
hex | 5bf89b1c2917 |
101123312331031 has 2 divisors, whose sum is σ = 101123312331032. Its totient is φ = 101123312331030.
The previous prime is 101123312331017. The next prime is 101123312331061. The reversal of 101123312331031 is 130133213321101.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 101123312331031 - 29 = 101123312330519 is a prime.
It is a super-2 number, since 2×1011233123310312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 101123312330987 and 101123312331005.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101123312331061) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50561656165515 + 50561656165516.
It is an arithmetic number, because the mean of its divisors is an integer number (50561656165516).
Almost surely, 2101123312331031 is an apocalyptic number.
101123312331031 is a deficient number, since it is larger than the sum of its proper divisors (1).
101123312331031 is an equidigital number, since it uses as much as digits as its factorization.
101123312331031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 972, while the sum is 25.
Adding to 101123312331031 its reverse (130133213321101), we get a palindrome (231256525652132).
The spelling of 101123312331031 in words is "one hundred one trillion, one hundred twenty-three billion, three hundred twelve million, three hundred thirty-one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •