Base | Representation |
---|---|
bin | 10110111101110001101001… |
… | …100000010110001010110111 |
3 | 111020121201101102222110012111 |
4 | 112331301221200112022313 |
5 | 101214310022040113311 |
6 | 554451440233231451 |
7 | 30163112123224615 |
oct | 2675615140261267 |
9 | 436551342873174 |
10 | 101002221019831 |
11 | 2a20088a70914a |
12 | b3b2aa7562587 |
13 | 44486125c27b1 |
14 | 1ad27682086b5 |
15 | ba2476005d21 |
hex | 5bdc698162b7 |
101002221019831 has 2 divisors, whose sum is σ = 101002221019832. Its totient is φ = 101002221019830.
The previous prime is 101002221019811. The next prime is 101002221019837. The reversal of 101002221019831 is 138910122200101.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 101002221019831 - 29 = 101002221019319 is a prime.
It is a super-2 number, since 2×1010022210198312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 101002221019793 and 101002221019802.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101002221019837) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50501110509915 + 50501110509916.
It is an arithmetic number, because the mean of its divisors is an integer number (50501110509916).
Almost surely, 2101002221019831 is an apocalyptic number.
101002221019831 is a deficient number, since it is larger than the sum of its proper divisors (1).
101002221019831 is an equidigital number, since it uses as much as digits as its factorization.
101002221019831 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1728, while the sum is 31.
Adding to 101002221019831 its reverse (138910122200101), we get a palindrome (239912343219932).
The spelling of 101002221019831 in words is "one hundred one trillion, two billion, two hundred twenty-one million, nineteen thousand, eight hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •