Base | Representation |
---|---|
bin | 1011010101000110110… |
… | …1011000111101000001 |
3 | 200121102002202002001212 |
4 | 2311101231120331001 |
5 | 11142112430202010 |
6 | 225230212335505 |
7 | 20030316641630 |
oct | 2652155307501 |
9 | 617362662055 |
10 | 194644381505 |
11 | 75603751812 |
12 | 31882014595 |
13 | 1547c8bac52 |
14 | 95c6acd517 |
15 | 50e31c4505 |
hex | 2d51b58f41 |
194644381505 has 8 divisors (see below), whose sum is σ = 266940866112. Its totient is φ = 133470433008.
The previous prime is 194644381487. The next prime is 194644381507. The reversal of 194644381505 is 505183446491.
194644381505 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 194644381505 - 212 = 194644377409 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (194644381507) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2780633987 + ... + 2780634056.
It is an arithmetic number, because the mean of its divisors is an integer number (33367608264).
Almost surely, 2194644381505 is an apocalyptic number.
It is an amenable number.
194644381505 is a deficient number, since it is larger than the sum of its proper divisors (72296484607).
194644381505 is an equidigital number, since it uses as much as digits as its factorization.
194644381505 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5561268055.
The product of its (nonzero) digits is 2073600, while the sum is 50.
The spelling of 194644381505 in words is "one hundred ninety-four billion, six hundred forty-four million, three hundred eighty-one thousand, five hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •