Base | Representation |
---|---|
bin | 1011010010111111011… |
… | …1100110111110111000 |
3 | 200112221112102120100220 |
4 | 2310233313212332320 |
5 | 11134432104310224 |
6 | 225054011500040 |
7 | 20010254115324 |
oct | 2645767467670 |
9 | 615845376326 |
10 | 194076635064 |
11 | 75342223484 |
12 | 31743a57620 |
13 | 153bc0a6000 |
14 | 9571540984 |
15 | 50ad428279 |
hex | 2d2fde6fb8 |
194076635064 has 128 divisors (see below), whose sum is σ = 548461670400. Its totient is φ = 57119187840.
The previous prime is 194076635063. The next prime is 194076635083. The reversal of 194076635064 is 460536670491.
It is a junction number, because it is equal to n+sod(n) for n = 194076634998 and 194076635016.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (194076635063) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1132729 + ... + 1292759.
It is an arithmetic number, because the mean of its divisors is an integer number (4284856800).
Almost surely, 2194076635064 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 194076635064, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (274230835200).
194076635064 is an abundant number, since it is smaller than the sum of its proper divisors (354385035336).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
194076635064 is a wasteful number, since it uses less digits than its factorization.
194076635064 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 160102 (or 160072 counting only the distinct ones).
The product of its (nonzero) digits is 3265920, while the sum is 51.
The spelling of 194076635064 in words is "one hundred ninety-four billion, seventy-six million, six hundred thirty-five thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •