Base | Representation |
---|---|
bin | 10111000010011011101001… |
… | …101111010100110110010011 |
3 | 111021202022022022220100022022 |
4 | 113002123221233110312103 |
5 | 101240030331200311011 |
6 | 555254435345402055 |
7 | 30225200366611352 |
oct | 2702335157246623 |
9 | 437668268810268 |
10 | 101322200010131 |
11 | 2a31455a494581 |
12 | b444b0793932b |
13 | 446c847651149 |
14 | 1b04040923999 |
15 | baa9526808db |
hex | 5c26e9bd4d93 |
101322200010131 has 2 divisors, whose sum is σ = 101322200010132. Its totient is φ = 101322200010130.
The previous prime is 101322200010067. The next prime is 101322200010169. The reversal of 101322200010131 is 131010002223101.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 101322200010131 - 26 = 101322200010067 is a prime.
It is a super-2 number, since 2×1013222000101312 (a number of 29 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is not a weakly prime, because it can be changed into another prime (101322200010191) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50661100005065 + 50661100005066.
It is an arithmetic number, because the mean of its divisors is an integer number (50661100005066).
Almost surely, 2101322200010131 is an apocalyptic number.
101322200010131 is a deficient number, since it is larger than the sum of its proper divisors (1).
101322200010131 is an equidigital number, since it uses as much as digits as its factorization.
101322200010131 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 101322200010131 its reverse (131010002223101), we get a palindrome (232332202233232).
The spelling of 101322200010131 in words is "one hundred one trillion, three hundred twenty-two billion, two hundred million, ten thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •