Base | Representation |
---|---|
bin | 10110110010001111111011… |
… | …011111000101001111100011 |
3 | 111010210222210020210221211221 |
4 | 112302033323133011033203 |
5 | 101113320241402242011 |
6 | 553043515052515511 |
7 | 30051640504032301 |
oct | 2662177337051743 |
9 | 433728706727757 |
10 | 100210101212131 |
11 | 29a25957731579 |
12 | b2a548017bb97 |
13 | 43bba060cba01 |
14 | 1aa62a2681271 |
15 | b8ba64945971 |
hex | 5b23fb7c53e3 |
100210101212131 has 2 divisors, whose sum is σ = 100210101212132. Its totient is φ = 100210101212130.
The previous prime is 100210101211993. The next prime is 100210101212159. The reversal of 100210101212131 is 131212101012001.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 100210101212131 - 213 = 100210101203939 is a prime.
It is a super-2 number, since 2×1002101012121312 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (100210101212231) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50105050606065 + 50105050606066.
It is an arithmetic number, because the mean of its divisors is an integer number (50105050606066).
Almost surely, 2100210101212131 is an apocalyptic number.
100210101212131 is a deficient number, since it is larger than the sum of its proper divisors (1).
100210101212131 is an equidigital number, since it uses as much as digits as its factorization.
100210101212131 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 16.
Adding to 100210101212131 its reverse (131212101012001), we get a palindrome (231422202224132).
The spelling of 100210101212131 in words is "one hundred trillion, two hundred ten billion, one hundred one million, two hundred twelve thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •