Base | Representation |
---|---|
bin | 1100101010011… |
… | …01011000110001 |
3 | 21101212200202212 |
4 | 12111031120301 |
5 | 204143120103 |
6 | 14312421505 |
7 | 2426611331 |
oct | 625153061 |
9 | 241780685 |
10 | 106223153 |
11 | 54a62033 |
12 | 2b6a7895 |
13 | 1901224a |
14 | 101710c1 |
15 | 94d37d8 |
hex | 654d631 |
106223153 has 2 divisors, whose sum is σ = 106223154. Its totient is φ = 106223152.
The previous prime is 106223141. The next prime is 106223197. The reversal of 106223153 is 351322601.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 65480464 + 40742689 = 8092^2 + 6383^2 .
It is a cyclic number.
It is not a de Polignac number, because 106223153 - 226 = 39114289 is a prime.
It is a super-2 number, since 2×1062231532 = 22566716466522818, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Chen prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (106223113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 53111576 + 53111577.
It is an arithmetic number, because the mean of its divisors is an integer number (53111577).
Almost surely, 2106223153 is an apocalyptic number.
It is an amenable number.
106223153 is a deficient number, since it is larger than the sum of its proper divisors (1).
106223153 is an equidigital number, since it uses as much as digits as its factorization.
106223153 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1080, while the sum is 23.
The square root of 106223153 is about 10306.4617109850. The cubic root of 106223153 is about 473.5942229810.
Adding to 106223153 its reverse (351322601), we get a palindrome (457545754).
The spelling of 106223153 in words is "one hundred six million, two hundred twenty-three thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •