Base | Representation |
---|---|
bin | 10001110101011100… |
… | …010001111011110000 |
3 | 1211102121111211001020 |
4 | 101311130101323300 |
5 | 303204423420234 |
6 | 12444131335440 |
7 | 1245363105165 |
oct | 216534217360 |
9 | 54377454036 |
10 | 19150216944 |
11 | 8137886481 |
12 | 3865451580 |
13 | 1a62614321 |
14 | cd94bc06c |
15 | 77135d549 |
hex | 475711ef0 |
19150216944 has 160 divisors (see below), whose sum is σ = 52781621760. Its totient is φ = 5969593344.
The previous prime is 19150216937. The next prime is 19150216951. The reversal of 19150216944 is 44961205191.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (19150216937) and next prime (19150216951).
It is a junction number, because it is equal to n+sod(n) for n = 19150216896 and 19150216905.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 29782287 + ... + 29782929.
It is an arithmetic number, because the mean of its divisors is an integer number (329885136).
Almost surely, 219150216944 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 19150216944, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (26390810880).
19150216944 is an abundant number, since it is smaller than the sum of its proper divisors (33631404816).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
19150216944 is a wasteful number, since it uses less digits than its factorization.
19150216944 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1239 (or 1233 counting only the distinct ones).
The product of its (nonzero) digits is 77760, while the sum is 42.
The spelling of 19150216944 in words is "nineteen billion, one hundred fifty million, two hundred sixteen thousand, nine hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •