Base | Representation |
---|---|
bin | 1100101000101… |
… | …11111001010101 |
3 | 21101110120020001 |
4 | 12110113321111 |
5 | 204114112203 |
6 | 14304011301 |
7 | 2425006501 |
oct | 624277125 |
9 | 241416201 |
10 | 106004053 |
11 | 54922461 |
12 | 2b600b31 |
13 | 18c665bc |
14 | 10115301 |
15 | 948d91d |
hex | 6517e55 |
106004053 has 2 divisors, whose sum is σ = 106004054. Its totient is φ = 106004052.
The previous prime is 106004051. The next prime is 106004071. The reversal of 106004053 is 350400601.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 83942244 + 22061809 = 9162^2 + 4697^2 .
It is a cyclic number.
It is not a de Polignac number, because 106004053 - 21 = 106004051 is a prime.
It is a super-2 number, since 2×1060040532 = 22473718504853618, which contains 22 as substring.
Together with 106004051, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 106004053.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (106004051) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 53002026 + 53002027.
It is an arithmetic number, because the mean of its divisors is an integer number (53002027).
Almost surely, 2106004053 is an apocalyptic number.
It is an amenable number.
106004053 is a deficient number, since it is larger than the sum of its proper divisors (1).
106004053 is an equidigital number, since it uses as much as digits as its factorization.
106004053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 360, while the sum is 19.
The square root of 106004053 is about 10295.8269701855. The cubic root of 106004053 is about 473.2683809020.
Adding to 106004053 its reverse (350400601), we get a palindrome (456404654).
The spelling of 106004053 in words is "one hundred six million, four thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •