Base | Representation |
---|---|
bin | 10010010001100000… |
… | …010100001110010110 |
3 | 1212122102102221200020 |
4 | 102101200110032112 |
5 | 310140441140300 |
6 | 13002550530010 |
7 | 1263141030234 |
oct | 222140241626 |
9 | 55572387606 |
10 | 19621036950 |
11 | 8359622519 |
12 | 3977066906 |
13 | 1b09020748 |
14 | d41c39954 |
15 | 79c8608a0 |
hex | 491814396 |
19621036950 has 48 divisors (see below), whose sum is σ = 48684242640. Its totient is φ = 5229688320.
The previous prime is 19621036927. The next prime is 19621036973. The reversal of 19621036950 is 5963012691.
It is an interprime number because it is at equal distance from previous prime (19621036927) and next prime (19621036973).
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 282042 + ... + 344658.
It is an arithmetic number, because the mean of its divisors is an integer number (1014255055).
Almost surely, 219621036950 is an apocalyptic number.
19621036950 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
19621036950 is an abundant number, since it is smaller than the sum of its proper divisors (29063205690).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
19621036950 is a wasteful number, since it uses less digits than its factorization.
19621036950 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 64721 (or 64716 counting only the distinct ones).
The product of its (nonzero) digits is 87480, while the sum is 42.
The spelling of 19621036950 in words is "nineteen billion, six hundred twenty-one million, thirty-six thousand, nine hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •