Base | Representation |
---|---|
bin | 101101010110111000000000… |
… | …000110000101011100000001 |
3 | 222011022111012121121202200001 |
4 | 231112320000012011130001 |
5 | 202121321314433001103 |
6 | 1544133413022400001 |
7 | 60006150534065002 |
oct | 5526700006053401 |
9 | 864274177552601 |
10 | 199484052625153 |
11 | 5861a79119411a |
12 | 1a459419730001 |
13 | 874035b25213a |
14 | 373911884b1a9 |
15 | 180e0883ad01d |
hex | b56e00185701 |
199484052625153 has 2 divisors, whose sum is σ = 199484052625154. Its totient is φ = 199484052625152.
The previous prime is 199484052625129. The next prime is 199484052625217. The reversal of 199484052625153 is 351526250484991.
It is an a-pointer prime, because the next prime (199484052625217) can be obtained adding 199484052625153 to its sum of digits (64).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 159932242330624 + 39551810294529 = 12646432^2 + 6289023^2 .
It is a cyclic number.
It is not a de Polignac number, because 199484052625153 - 29 = 199484052624641 is a prime.
It is not a weakly prime, because it can be changed into another prime (199484052695153) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 99742026312576 + 99742026312577.
It is an arithmetic number, because the mean of its divisors is an integer number (99742026312577).
Almost surely, 2199484052625153 is an apocalyptic number.
It is an amenable number.
199484052625153 is a deficient number, since it is larger than the sum of its proper divisors (1).
199484052625153 is an equidigital number, since it uses as much as digits as its factorization.
199484052625153 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 93312000, while the sum is 64.
The spelling of 199484052625153 in words is "one hundred ninety-nine trillion, four hundred eighty-four billion, fifty-two million, six hundred twenty-five thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •