Base | Representation |
---|---|
bin | 10111000010100011111101… |
… | …011110101101011000101101 |
3 | 111021210011100001120100101011 |
4 | 113002203331132231120231 |
5 | 101240202114002224401 |
6 | 555302512512145221 |
7 | 30225634434114256 |
oct | 2702437536553055 |
9 | 437704301510334 |
10 | 101331121133101 |
11 | 2a318318201282 |
12 | b446797538211 |
13 | 4470639975232 |
14 | 1b04649685b2d |
15 | baacc597b451 |
hex | 5c28fd7ad62d |
101331121133101 has 2 divisors, whose sum is σ = 101331121133102. Its totient is φ = 101331121133100.
The previous prime is 101331121133059. The next prime is 101331121133111.
101331121133101 is nontrivially palindromic in base 10.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 51654420784201 + 49676700348900 = 7187101^2 + 7048170^2 .
It is a palprime.
It is a cyclic number.
It is not a de Polignac number, because 101331121133101 - 29 = 101331121132589 is a prime.
It is a super-2 number, since 2×1013311211331012 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101331121133111) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50665560566550 + 50665560566551.
It is an arithmetic number, because the mean of its divisors is an integer number (50665560566551).
Almost surely, 2101331121133101 is an apocalyptic number.
It is an amenable number.
101331121133101 is a deficient number, since it is larger than the sum of its proper divisors (1).
101331121133101 is an equidigital number, since it uses as much as digits as its factorization.
101331121133101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 162, while the sum is 22.
The spelling of 101331121133101 in words is "one hundred one trillion, three hundred thirty-one billion, one hundred twenty-one million, one hundred thirty-three thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •