Base | Representation |
---|---|
bin | 100111110101111011… |
… | …001110101011010101 |
3 | 11002102110100012110211 |
4 | 213311323032223111 |
5 | 1200103321301242 |
6 | 31353025445421 |
7 | 3043100345455 |
oct | 476573165325 |
9 | 132373305424 |
10 | 42780650197 |
11 | 1716361a75a |
12 | 835b1a0871 |
13 | 405a1962cc |
14 | 20db9d5d65 |
15 | 11a5b9d317 |
hex | 9f5ecead5 |
42780650197 has 2 divisors, whose sum is σ = 42780650198. Its totient is φ = 42780650196.
The previous prime is 42780650191. The next prime is 42780650261. The reversal of 42780650197 is 79105608724.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 23688595921 + 19092054276 = 153911^2 + 138174^2 .
It is a cyclic number.
It is not a de Polignac number, because 42780650197 - 211 = 42780648149 is a prime.
It is a super-2 number, since 2×427806501972 (a number of 22 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 42780650197.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (42780650191) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 21390325098 + 21390325099.
It is an arithmetic number, because the mean of its divisors is an integer number (21390325099).
Almost surely, 242780650197 is an apocalyptic number.
It is an amenable number.
42780650197 is a deficient number, since it is larger than the sum of its proper divisors (1).
42780650197 is an equidigital number, since it uses as much as digits as its factorization.
42780650197 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 846720, while the sum is 49.
The spelling of 42780650197 in words is "forty-two billion, seven hundred eighty million, six hundred fifty thousand, one hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •