Base | Representation |
---|---|
bin | 10111001110000… |
… | …01111100101010 |
3 | 111120111220021000 |
4 | 23213001330222 |
5 | 344330442340 |
6 | 31154455430 |
7 | 4553416356 |
oct | 1347017452 |
9 | 446456230 |
10 | 194780970 |
11 | 9aa4890a |
12 | 55294576 |
13 | 3147a917 |
14 | 1bc24466 |
15 | 12177d30 |
hex | b9c1f2a |
194780970 has 128 divisors (see below), whose sum is σ = 560102400. Its totient is φ = 48009024.
The previous prime is 194780969. The next prime is 194780977. The reversal of 194780970 is 79087491.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (194780977) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 220149 + ... + 221031.
It is an arithmetic number, because the mean of its divisors is an integer number (4375800).
Almost surely, 2194780970 is an apocalyptic number.
194780970 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 194780970, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (280051200).
194780970 is an abundant number, since it is smaller than the sum of its proper divisors (365321430).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
194780970 is a wasteful number, since it uses less digits than its factorization.
194780970 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 961 (or 955 counting only the distinct ones).
The product of its (nonzero) digits is 127008, while the sum is 45.
The square root of 194780970 is about 13956.3953082449. The cubic root of 194780970 is about 579.6718020344.
The spelling of 194780970 in words is "one hundred ninety-four million, seven hundred eighty thousand, nine hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •