Base | Representation |
---|---|
bin | 1010000000110101000… |
… | …0011100101000011101 |
3 | 121110000110001200000121 |
4 | 2200031100130220131 |
5 | 10304244400412404 |
6 | 211005253154541 |
7 | 15266562200026 |
oct | 2401520345035 |
9 | 543013050017 |
10 | 172021107229 |
11 | 66a54480a24 |
12 | 2940962ba51 |
13 | 132b58b181a |
14 | 847c267c4d |
15 | 471becbe54 |
hex | 280d41ca1d |
172021107229 has 2 divisors, whose sum is σ = 172021107230. Its totient is φ = 172021107228.
The previous prime is 172021107217. The next prime is 172021107241. The reversal of 172021107229 is 922701120271.
It is a balanced prime because it is at equal distance from previous prime (172021107217) and next prime (172021107241).
It can be written as a sum of positive squares in only one way, i.e., 117304880004 + 54716227225 = 342498^2 + 233915^2 .
It is a cyclic number.
It is not a de Polignac number, because 172021107229 - 25 = 172021107197 is a prime.
It is a super-2 number, since 2×1720211072292 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 172021107194 and 172021107203.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (172021137229) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 86010553614 + 86010553615.
It is an arithmetic number, because the mean of its divisors is an integer number (86010553615).
Almost surely, 2172021107229 is an apocalyptic number.
It is an amenable number.
172021107229 is a deficient number, since it is larger than the sum of its proper divisors (1).
172021107229 is an equidigital number, since it uses as much as digits as its factorization.
172021107229 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7056, while the sum is 34.
The spelling of 172021107229 in words is "one hundred seventy-two billion, twenty-one million, one hundred seven thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •