Base | Representation |
---|---|
bin | 10110111110011000110000… |
… | …011100100110100011101111 |
3 | 111020202201202222001220020121 |
4 | 112332120300130212203233 |
5 | 101221002022113110111 |
6 | 554523023144025411 |
7 | 30166126542524323 |
oct | 2676306034464357 |
9 | 436681688056217 |
10 | 101044213410031 |
11 | 2a217679286461 |
12 | b3bb066762267 |
13 | 444c575386768 |
14 | 1ad47cd24d983 |
15 | ba35d289a871 |
hex | 5be6307268ef |
101044213410031 has 2 divisors, whose sum is σ = 101044213410032. Its totient is φ = 101044213410030.
The previous prime is 101044213409981. The next prime is 101044213410043. The reversal of 101044213410031 is 130014312440101.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 101044213410031 - 27 = 101044213409903 is a prime.
It is a super-2 number, since 2×1010442134100312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 101044213409978 and 101044213410005.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101044213414031) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50522106705015 + 50522106705016.
It is an arithmetic number, because the mean of its divisors is an integer number (50522106705016).
Almost surely, 2101044213410031 is an apocalyptic number.
101044213410031 is a deficient number, since it is larger than the sum of its proper divisors (1).
101044213410031 is an equidigital number, since it uses as much as digits as its factorization.
101044213410031 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1152, while the sum is 25.
Adding to 101044213410031 its reverse (130014312440101), we get a palindrome (231058525850132).
The spelling of 101044213410031 in words is "one hundred one trillion, forty-four billion, two hundred thirteen million, four hundred ten thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •