Base | Representation |
---|---|
bin | 1001010001010111110100… |
… | …1101011101000001110101 |
3 | 1100002112122102201201201002 |
4 | 2110111331031131001311 |
5 | 2314004412331302211 |
6 | 33403030255013045 |
7 | 2101332155630504 |
oct | 224257515350165 |
9 | 40075572651632 |
10 | 10194058072181 |
11 | 3280304028975 |
12 | 118781550a185 |
13 | 58c3ac432279 |
14 | 273575dda83b |
15 | 12a28690103b |
hex | 9457d35d075 |
10194058072181 has 2 divisors, whose sum is σ = 10194058072182. Its totient is φ = 10194058072180.
The previous prime is 10194058072103. The next prime is 10194058072223. The reversal of 10194058072181 is 18127085049101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5872819092100 + 4321238980081 = 2423390^2 + 2078759^2 .
It is a cyclic number.
It is not a de Polignac number, because 10194058072181 - 222 = 10194053877877 is a prime.
It is a super-2 number, since 2×101940580721812 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10794058072181) 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, 5097029036090 + 5097029036091.
It is an arithmetic number, because the mean of its divisors is an integer number (5097029036091).
Almost surely, 210194058072181 is an apocalyptic number.
It is an amenable number.
10194058072181 is a deficient number, since it is larger than the sum of its proper divisors (1).
10194058072181 is an equidigital number, since it uses as much as digits as its factorization.
10194058072181 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 161280, while the sum is 47.
The spelling of 10194058072181 in words is "ten trillion, one hundred ninety-four billion, fifty-eight million, seventy-two thousand, one hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •