Base | Representation |
---|---|
bin | 1011010011101001000… |
… | …0001111110111001001 |
3 | 200120101200021102110000 |
4 | 2310322100033313021 |
5 | 11140311210203441 |
6 | 225123154113213 |
7 | 20014501055514 |
oct | 2647220176711 |
9 | 616350242400 |
10 | 194250866121 |
11 | 75421605894 |
12 | 3179227b809 |
13 | 1541920a100 |
14 | 958a735d7b |
15 | 50bd8922b6 |
hex | 2d3a40fdc9 |
194250866121 has 45 divisors (see below), whose sum is σ = 314299004151. Its totient is φ = 119507261328.
The previous prime is 194250866119. The next prime is 194250866167. The reversal of 194250866121 is 121668052491.
The square root of 194250866121 is 440739.
It is a perfect power (a square), and thus also a powerful number.
194250866121 is a `hidden beast` number, since 1 + 9 + 4 + 25 + 0 + 8 + 6 + 612 + 1 = 666.
It can be written as a sum of positive squares in only one way, i.e., 28735335225 + 165515530896 = 169515^2 + 406836^2 .
It is not a de Polignac number, because 194250866121 - 21 = 194250866119 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (194250866111) by changing a digit.
It is a polite number, since it can be written in 44 ways as a sum of consecutive naturals, for example, 51564580 + ... + 51568346.
Almost surely, 2194250866121 is an apocalyptic number.
194250866121 is the 440739-th square number.
194250866121 is the 220370-th centered octagonal number.
It is an amenable number.
194250866121 is a deficient number, since it is larger than the sum of its proper divisors (120048138030).
194250866121 is an frugal number, since it uses more digits than its factorization.
194250866121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7572 (or 3783 counting only the distinct ones).
The product of its (nonzero) digits is 207360, while the sum is 45.
The spelling of 194250866121 in words is "one hundred ninety-four billion, two hundred fifty million, eight hundred sixty-six thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •