Base | Representation |
---|---|
bin | 1011101000111001001… |
… | …1100101101100000101 |
3 | 201010010021111000112022 |
4 | 2322032103211230011 |
5 | 11234002213323042 |
6 | 231505234532525 |
7 | 20306044626464 |
oct | 2721623455405 |
9 | 633107430468 |
10 | 199955995397 |
11 | 77889a45964 |
12 | 32904a37145 |
13 | 15b18182952 |
14 | 996c3089db |
15 | 5304680cd2 |
hex | 2e8e4e5b05 |
199955995397 has 8 divisors (see below), whose sum is σ = 200358945600. Its totient is φ = 199553124960.
The previous prime is 199955995391. The next prime is 199955995429. The reversal of 199955995397 is 793599559991.
199955995397 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 199955995397 - 236 = 131236518661 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (199955995391) 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 in 7 ways as a sum of consecutive naturals, for example, 9114872 + ... + 9136782.
It is an arithmetic number, because the mean of its divisors is an integer number (25044868200).
Almost surely, 2199955995397 is an apocalyptic number.
It is an amenable number.
199955995397 is a deficient number, since it is larger than the sum of its proper divisors (402950203).
199955995397 is a wasteful number, since it uses less digits than its factorization.
199955995397 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39883.
The product of its digits is 1395032625, while the sum is 80.
The spelling of 199955995397 in words is "one hundred ninety-nine billion, nine hundred fifty-five million, nine hundred ninety-five thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •