Base | Representation |
---|---|
bin | 10111000001000000011111… |
… | …000011011101010010100101 |
3 | 111021101221122020000101120121 |
4 | 113001000133003131102211 |
5 | 101231424341404412404 |
6 | 555141450044001541 |
7 | 30215133525333022 |
oct | 2701003703352245 |
9 | 437357566011517 |
10 | 101224310232229 |
11 | 2a286a97239588 |
12 | b429b488302b1 |
13 | 446354709b242 |
14 | 1add3d5c50549 |
15 | ba812382be54 |
hex | 5c101f0dd4a5 |
101224310232229 has 2 divisors, whose sum is σ = 101224310232230. Its totient is φ = 101224310232228.
The previous prime is 101224310232211. The next prime is 101224310232259. The reversal of 101224310232229 is 922232013422101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 80631456168004 + 20592854064225 = 8979502^2 + 4537935^2 .
It is a cyclic number.
It is not a de Polignac number, because 101224310232229 - 211 = 101224310230181 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 101224310232194 and 101224310232203.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101224310232209) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50612155116114 + 50612155116115.
It is an arithmetic number, because the mean of its divisors is an integer number (50612155116115).
Almost surely, 2101224310232229 is an apocalyptic number.
It is an amenable number.
101224310232229 is a deficient number, since it is larger than the sum of its proper divisors (1).
101224310232229 is an equidigital number, since it uses as much as digits as its factorization.
101224310232229 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 20736, while the sum is 34.
The spelling of 101224310232229 in words is "one hundred one trillion, two hundred twenty-four billion, three hundred ten million, two hundred thirty-two thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.169 sec. • engine limits •