Base | Representation |
---|---|
bin | 1011011011001001100… |
… | …0010100011110000111 |
3 | 200202121010120102201221 |
4 | 2312302120110132013 |
5 | 11203423124414241 |
6 | 230055150501211 |
7 | 20115442403605 |
oct | 2666230243607 |
9 | 622533512657 |
10 | 196266248071 |
11 | 762661a9103 |
12 | 32055204807 |
13 | 1567a90b8ca |
14 | 96dc276875 |
15 | 518a7925d1 |
hex | 2db2614787 |
196266248071 has 2 divisors, whose sum is σ = 196266248072. Its totient is φ = 196266248070.
The previous prime is 196266248069. The next prime is 196266248081. The reversal of 196266248071 is 170842662691.
196266248071 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 196266248071 - 21 = 196266248069 is a prime.
It is a super-4 number, since 4×1962662480714 (a number of 46 digits) contains 4444 as substring. Note that it is a super-d number also for d = 2.
Together with 196266248069, 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 (196266248011) 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, 98133124035 + 98133124036.
It is an arithmetic number, because the mean of its divisors is an integer number (98133124036).
Almost surely, 2196266248071 is an apocalyptic number.
196266248071 is a deficient number, since it is larger than the sum of its proper divisors (1).
196266248071 is an equidigital number, since it uses as much as digits as its factorization.
196266248071 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1741824, while the sum is 52.
The spelling of 196266248071 in words is "one hundred ninety-six billion, two hundred sixty-six million, two hundred forty-eight thousand, seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •