Base | Representation |
---|---|
bin | 10001111101110010… |
… | …011010101000001010 |
3 | 1211210100222121001220 |
4 | 101331302122220022 |
5 | 304001300044300 |
6 | 12510052422510 |
7 | 1252013212221 |
oct | 217562325012 |
9 | 54710877056 |
10 | 19290237450 |
11 | 81a9921a00 |
12 | 38a4317a36 |
13 | 1a8562aab3 |
14 | d0dd29cb8 |
15 | 77d7bada0 |
hex | 47dc9aa0a |
19290237450 has 288 divisors, whose sum is σ = 56319520320. Its totient is φ = 4350720000.
The previous prime is 19290237403. The next prime is 19290237503. The reversal of 19290237450 is 5473209291.
It is a super-2 number, since 2×192902374502 (a number of 21 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 143 ways as a sum of consecutive naturals, for example, 31163241 + ... + 31163859.
It is an arithmetic number, because the mean of its divisors is an integer number (195553890).
Almost surely, 219290237450 is an apocalyptic number.
19290237450 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 19290237450, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (28159760160).
19290237450 is an abundant number, since it is smaller than the sum of its proper divisors (37029282870).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
19290237450 is a wasteful number, since it uses less digits than its factorization.
19290237450 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 774 (or 758 counting only the distinct ones).
The product of its (nonzero) digits is 136080, while the sum is 42.
The spelling of 19290237450 in words is "nineteen billion, two hundred ninety million, two hundred thirty-seven thousand, four hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •