Base | Representation |
---|---|
bin | 10111011011001… |
… | …10001000000111 |
3 | 111200202100002201 |
4 | 23231212020013 |
5 | 400301031043 |
6 | 31255415331 |
7 | 4604145124 |
oct | 1355461007 |
9 | 450670081 |
10 | 196502023 |
11 | a0a13973 |
12 | 55984547 |
13 | 319310b3 |
14 | 1c15174b |
15 | 123b7c4d |
hex | bb66207 |
196502023 has 2 divisors, whose sum is σ = 196502024. Its totient is φ = 196502022.
The previous prime is 196502021. The next prime is 196502027. The reversal of 196502023 is 320205691.
196502023 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 196502023 - 21 = 196502021 is a prime.
It is a super-2 number, since 2×1965020232 = 77226090086185058, which contains 22 as substring.
Together with 196502021, it forms a pair of twin primes.
It is equal to p10896040 and since 196502023 and 10896040 have the same sum of digits, it is a Honaker prime.
It is a junction number, because it is equal to n+sod(n) for n = 196501982 and 196502000.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (196502021) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 98251011 + 98251012.
It is an arithmetic number, because the mean of its divisors is an integer number (98251012).
Almost surely, 2196502023 is an apocalyptic number.
196502023 is a deficient number, since it is larger than the sum of its proper divisors (1).
196502023 is an equidigital number, since it uses as much as digits as its factorization.
196502023 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3240, while the sum is 28.
The square root of 196502023 is about 14017.9179267108. The cubic root of 196502023 is about 581.3740933955.
The spelling of 196502023 in words is "one hundred ninety-six million, five hundred two thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •