Base | Representation |
---|---|
bin | 110001010111001110… |
… | …1000011110000011101 |
3 | 101010121202010020000001 |
4 | 1202232131003300131 |
5 | 3214100023141003 |
6 | 120410513534301 |
7 | 10441633466401 |
oct | 1425635036035 |
9 | 333552106001 |
10 | 106006068253 |
11 | 40a58731078 |
12 | 18665274391 |
13 | 9cc4c21597 |
14 | 51b89ad101 |
15 | 2b5667061d |
hex | 18ae743c1d |
106006068253 has 2 divisors, whose sum is σ = 106006068254. Its totient is φ = 106006068252.
The previous prime is 106006068229. The next prime is 106006068281. The reversal of 106006068253 is 352860600601.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 58577068729 + 47428999524 = 242027^2 + 217782^2 .
It is a cyclic number.
It is not a de Polignac number, because 106006068253 - 225 = 105972513821 is a prime.
It is a super-2 number, since 2×1060060682532 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (106006008253) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 53003034126 + 53003034127.
It is an arithmetic number, because the mean of its divisors is an integer number (53003034127).
Almost surely, 2106006068253 is an apocalyptic number.
It is an amenable number.
106006068253 is a deficient number, since it is larger than the sum of its proper divisors (1).
106006068253 is an equidigital number, since it uses as much as digits as its factorization.
106006068253 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 51840, while the sum is 37.
Adding to 106006068253 its reverse (352860600601), we get a palindrome (458866668854).
The spelling of 106006068253 in words is "one hundred six billion, six million, sixty-eight thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •