Base | Representation |
---|---|
bin | 10111000010101001101100… |
… | …010111011101101110111101 |
3 | 111021210202020000220222022022 |
4 | 113002221230113131232331 |
5 | 101240302220234103003 |
6 | 555305411354325525 |
7 | 30226243115460413 |
oct | 2702515427355675 |
9 | 437722200828268 |
10 | 101337276472253 |
11 | 2a31a996790728 |
12 | b447a14a298a5 |
13 | 44710aac8c153 |
14 | 1b04a70d6d2b3 |
15 | bab03604a738 |
hex | 5c2a6c5ddbbd |
101337276472253 has 2 divisors, whose sum is σ = 101337276472254. Its totient is φ = 101337276472252.
The previous prime is 101337276472177. The next prime is 101337276472337. The reversal of 101337276472253 is 352274672733101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 96664645185124 + 4672631287129 = 9831818^2 + 2161627^2 .
It is a cyclic number.
It is not a de Polignac number, because 101337276472253 - 28 = 101337276471997 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 101337276472195 and 101337276472204.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101337276471253) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50668638236126 + 50668638236127.
It is an arithmetic number, because the mean of its divisors is an integer number (50668638236127).
Almost surely, 2101337276472253 is an apocalyptic number.
It is an amenable number.
101337276472253 is a deficient number, since it is larger than the sum of its proper divisors (1).
101337276472253 is an equidigital number, since it uses as much as digits as its factorization.
101337276472253 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8890560, while the sum is 53.
The spelling of 101337276472253 in words is "one hundred one trillion, three hundred thirty-seven billion, two hundred seventy-six million, four hundred seventy-two thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.112 sec. • engine limits •