Base | Representation |
---|---|
bin | 10001110011100100… |
… | …001110010101111000 |
3 | 1211100102021212120220 |
4 | 101303210032111320 |
5 | 303123344314302 |
6 | 12441045020040 |
7 | 1244531436126 |
oct | 216344162570 |
9 | 54312255526 |
10 | 19118744952 |
11 | 812104006a |
12 | 38569b4620 |
13 | 1a58c45348 |
14 | cd5248916 |
15 | 76d6e34bc |
hex | 47390e578 |
19118744952 has 64 divisors (see below), whose sum is σ = 50641783200. Its totient is φ = 5994086400.
The previous prime is 19118744941. The next prime is 19118744959. The reversal of 19118744952 is 25944781191.
It is a Harshad number since it is a multiple of its sum of digits (51).
It is a junction number, because it is equal to n+sod(n) for n = 19118744895 and 19118744904.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (19118744959) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 638574 + ... + 667842.
Almost surely, 219118744952 is an apocalyptic number.
19118744952 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
19118744952 is an abundant number, since it is smaller than the sum of its proper divisors (31523038248).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
19118744952 is a wasteful number, since it uses less digits than its factorization.
19118744952 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30896 (or 30892 counting only the distinct ones).
The product of its digits is 725760, while the sum is 51.
The spelling of 19118744952 in words is "nineteen billion, one hundred eighteen million, seven hundred forty-four thousand, nine hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •