Base | Representation |
---|---|
bin | 10010100101011110… |
… | …111001111010101000 |
3 | 1220111210010120112120 |
4 | 102211132321322220 |
5 | 311332242230433 |
6 | 13100122511240 |
7 | 1304350666152 |
oct | 224536717250 |
9 | 56453116476 |
10 | 19956211368 |
11 | 8510840a75 |
12 | 3a4b365520 |
13 | 1b605b57c2 |
14 | d74567ad2 |
15 | 7bbebb7b3 |
hex | 4a57b9ea8 |
19956211368 has 64 divisors (see below), whose sum is σ = 51304104000. Its totient is φ = 6464051712.
The previous prime is 19956211361. The next prime is 19956211369. The reversal of 19956211368 is 86311265991.
It is a self number, because there is not a number n which added to its sum of digits gives 19956211368.
It is not an unprimeable number, because it can be changed into a prime (19956211361) 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 15 ways as a sum of consecutive naturals, for example, 704503 + ... + 732281.
It is an arithmetic number, because the mean of its divisors is an integer number (801626625).
Almost surely, 219956211368 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 19956211368, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (25652052000).
19956211368 is an abundant number, since it is smaller than the sum of its proper divisors (31347892632).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
19956211368 is a wasteful number, since it uses less digits than its factorization.
19956211368 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28634 (or 28630 counting only the distinct ones).
The product of its digits is 699840, while the sum is 51.
The spelling of 19956211368 in words is "nineteen billion, nine hundred fifty-six million, two hundred eleven thousand, three hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •