Base | Representation |
---|---|
bin | 1011100101100100101… |
… | …1011111111111110001 |
3 | 201000211011022122001211 |
4 | 2321121023133333301 |
5 | 11230141024314411 |
6 | 231240555000121 |
7 | 20245002611530 |
oct | 2713113377761 |
9 | 630734278054 |
10 | 199064682481 |
11 | 77471907315 |
12 | 326b6439041 |
13 | 15a0560b362 |
14 | 98c5bb0317 |
15 | 52a12bd221 |
hex | 2e592dfff1 |
199064682481 has 4 divisors (see below), whose sum is σ = 227502494272. Its totient is φ = 170626870692.
The previous prime is 199064682463. The next prime is 199064682539. The reversal of 199064682481 is 184286460991.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 184286460991 = 277 ⋅665294083.
It is a cyclic number.
It is not a de Polignac number, because 199064682481 - 227 = 198930464753 is a prime.
It is a super-2 number, since 2×1990646824812 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (199064682881) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 14218905885 + ... + 14218905898.
It is an arithmetic number, because the mean of its divisors is an integer number (56875623568).
Almost surely, 2199064682481 is an apocalyptic number.
It is an amenable number.
199064682481 is a deficient number, since it is larger than the sum of its proper divisors (28437811791).
199064682481 is an equidigital number, since it uses as much as digits as its factorization.
199064682481 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28437811790.
The product of its (nonzero) digits is 5971968, while the sum is 58.
The spelling of 199064682481 in words is "one hundred ninety-nine billion, sixty-four million, six hundred eighty-two thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •