Base | Representation |
---|---|
bin | 10111110011000… |
… | …01110011101101 |
3 | 111220122020221222 |
4 | 23321201303231 |
5 | 402101130221 |
6 | 31450433125 |
7 | 4642553561 |
oct | 1371416355 |
9 | 456566858 |
10 | 199630061 |
11 | a2760024 |
12 | 56a327a5 |
13 | 32487ac7 |
14 | 1c7276a1 |
15 | 127d49ab |
hex | be61ced |
199630061 has 4 divisors (see below), whose sum is σ = 202441824. Its totient is φ = 196818300.
The previous prime is 199630021. The next prime is 199630073. The reversal of 199630061 is 160036991.
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.
It is a cyclic number.
It is not a de Polignac number, because 199630061 - 226 = 132521197 is a prime.
It is a super-2 number, since 2×1996300612 = 79704322509727442, which contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (199630001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1405775 + ... + 1405916.
It is an arithmetic number, because the mean of its divisors is an integer number (50610456).
Almost surely, 2199630061 is an apocalyptic number.
It is an amenable number.
199630061 is a deficient number, since it is larger than the sum of its proper divisors (2811763).
199630061 is an equidigital number, since it uses as much as digits as its factorization.
199630061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2811762.
The product of its (nonzero) digits is 8748, while the sum is 35.
The square root of 199630061 is about 14129.0502511669. The cubic root of 199630061 is about 584.4427557000.
The spelling of 199630061 in words is "one hundred ninety-nine million, six hundred thirty thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •