Base | Representation |
---|---|
bin | 110001011101000101… |
… | …0101000010110110111 |
3 | 101011010102212020112011 |
4 | 1202322022220112313 |
5 | 3220000324022043 |
6 | 120442213305051 |
7 | 10446540620353 |
oct | 1427212502667 |
9 | 334112766464 |
10 | 106202564023 |
11 | 41049640276 |
12 | 186bb035187 |
13 | a02684c87a |
14 | 51d6b1c463 |
15 | 2b68a3659d |
hex | 18ba2a85b7 |
106202564023 has 2 divisors, whose sum is σ = 106202564024. Its totient is φ = 106202564022.
The previous prime is 106202564021. The next prime is 106202564051. The reversal of 106202564023 is 320465202601.
It is a weak prime.
It is an emirp because it is prime and its reverse (320465202601) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 106202564023 - 21 = 106202564021 is a prime.
It is a super-2 number, since 2×1062025640232 (a number of 23 digits) contains 22 as substring.
Together with 106202564021, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (106202564021) 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, 53101282011 + 53101282012.
It is an arithmetic number, because the mean of its divisors is an integer number (53101282012).
Almost surely, 2106202564023 is an apocalyptic number.
106202564023 is a deficient number, since it is larger than the sum of its proper divisors (1).
106202564023 is an equidigital number, since it uses as much as digits as its factorization.
106202564023 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 17280, while the sum is 31.
Adding to 106202564023 its reverse (320465202601), we get a palindrome (426667766624).
The spelling of 106202564023 in words is "one hundred six billion, two hundred two million, five hundred sixty-four thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.136 sec. • engine limits •