Base | Representation |
---|---|
bin | 101100001001111001011101… |
… | …000111011011101111100001 |
3 | 221110120210012122011010111101 |
4 | 230021321131013123233201 |
5 | 200423134222132113243 |
6 | 1525003331244514401 |
7 | 55622032433616001 |
oct | 5411713507335741 |
9 | 843523178133441 |
10 | 194194213551073 |
11 | 56970337a0a3aa |
12 | 1994418124ba01 |
13 | 84485884a2798 |
14 | 35d509b616001 |
15 | 176b68557754d |
hex | b09e5d1dbbe1 |
194194213551073 has 8 divisors (see below), whose sum is σ = 200042002248480. Its totient is φ = 188399346018720.
The previous prime is 194194213551053. The next prime is 194194213551097. The reversal of 194194213551073 is 370155312491491.
It is a happy number.
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 194194213551073 - 229 = 194193676680161 is a prime.
It is a super-2 number, since 2×1941942135510732 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (194194213551053) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 13230283815 + ... + 13230298492.
It is an arithmetic number, because the mean of its divisors is an integer number (25005250281060).
Almost surely, 2194194213551073 is an apocalyptic number.
It is an amenable number.
194194213551073 is a deficient number, since it is larger than the sum of its proper divisors (5847788697407).
194194213551073 is a wasteful number, since it uses less digits than its factorization.
194194213551073 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26460582527.
The product of its (nonzero) digits is 4082400, while the sum is 55.
The spelling of 194194213551073 in words is "one hundred ninety-four trillion, one hundred ninety-four billion, two hundred thirteen million, five hundred fifty-one thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •