Base | Representation |
---|---|
bin | 101100010101010001101110… |
… | …111010001111001001010111 |
3 | 221120100112122100100000100222 |
4 | 230111101232322033021113 |
5 | 201023442222202114432 |
6 | 1530402454501224555 |
7 | 56032364621065532 |
oct | 5425215672171127 |
9 | 846315570300328 |
10 | 194976196129367 |
11 | 57141a38772534 |
12 | 19a4b83970215b |
13 | 84a423a72bb83 |
14 | 3620c80ad7a19 |
15 | 1781ba1bbe112 |
hex | b1546ee8f257 |
194976196129367 has 2 divisors, whose sum is σ = 194976196129368. Its totient is φ = 194976196129366.
The previous prime is 194976196129333. The next prime is 194976196129369. The reversal of 194976196129367 is 763921691679491.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 194976196129367 - 236 = 194907476652631 is a prime.
It is a super-2 number, since 2×1949761961293672 (a number of 29 digits) contains 22 as substring.
Together with 194976196129369, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 194976196129291 and 194976196129300.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (194976196129369) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 97488098064683 + 97488098064684.
It is an arithmetic number, because the mean of its divisors is an integer number (97488098064684).
Almost surely, 2194976196129367 is an apocalyptic number.
194976196129367 is a deficient number, since it is larger than the sum of its proper divisors (1).
194976196129367 is an equidigital number, since it uses as much as digits as its factorization.
194976196129367 is an evil number, because the sum of its binary digits is even.
The product of its digits is 1666598976, while the sum is 80.
The spelling of 194976196129367 in words is "one hundred ninety-four trillion, nine hundred seventy-six billion, one hundred ninety-six million, one hundred twenty-nine thousand, three hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •