Base | Representation |
---|---|
bin | 11101011001011101010… |
… | …10100011010100101111 |
3 | 10120120020121202211021212 |
4 | 32230232222203110233 |
5 | 113022141124034411 |
6 | 2052011133145035 |
7 | 132656140134113 |
oct | 16545652432457 |
9 | 3516217684255 |
10 | 1010100221231 |
11 | 35a421272672 |
12 | 14392062b17b |
13 | 743379763ca |
14 | 36c63a17743 |
15 | 1b41d31e68b |
hex | eb2eaa352f |
1010100221231 has 2 divisors, whose sum is σ = 1010100221232. Its totient is φ = 1010100221230.
The previous prime is 1010100221213. The next prime is 1010100221237. The reversal of 1010100221231 is 1321220010101.
Together with previous prime (1010100221213) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1010100221231 is a prime.
It is a super-2 number, since 2×10101002212312 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1010100221237) 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, 505050110615 + 505050110616.
It is an arithmetic number, because the mean of its divisors is an integer number (505050110616).
Almost surely, 21010100221231 is an apocalyptic number.
1010100221231 is a deficient number, since it is larger than the sum of its proper divisors (1).
1010100221231 is an equidigital number, since it uses as much as digits as its factorization.
1010100221231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 1010100221231 its reverse (1321220010101), we get a palindrome (2331320231332).
The spelling of 1010100221231 in words is "one trillion, ten billion, one hundred million, two hundred twenty-one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •