Base | Representation |
---|---|
bin | 10010010001011101… |
… | …111000100101110010 |
3 | 1212122101020120020000 |
4 | 102101131320211302 |
5 | 310140310240344 |
6 | 13002525130430 |
7 | 1263132433554 |
oct | 222135704562 |
9 | 55571216200 |
10 | 19620399474 |
11 | 8359227585 |
12 | 39769b9a16 |
13 | 1b08b59540 |
14 | d41b114d4 |
15 | 79c786a69 |
hex | 491778972 |
19620399474 has 80 divisors (see below), whose sum is σ = 47630455488. Its totient is φ = 6000788448.
The previous prime is 19620399443. The next prime is 19620399497. The reversal of 19620399474 is 47499302691.
19620399474 is a `hidden beast` number, since 1 + 9 + 620 + 3 + 9 + 9 + 4 + 7 + 4 = 666.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is a self number, because there is not a number n which added to its sum of digits gives 19620399474.
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 39 ways as a sum of consecutive naturals, for example, 323809 + ... + 379595.
Almost surely, 219620399474 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 19620399474, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (23815227744).
19620399474 is an abundant number, since it is smaller than the sum of its proper divisors (28010056014).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
19620399474 is a wasteful number, since it uses less digits than its factorization.
19620399474 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55981 (or 55972 counting only the distinct ones).
The product of its (nonzero) digits is 2939328, while the sum is 54.
The spelling of 19620399474 in words is "nineteen billion, six hundred twenty million, three hundred ninety-nine thousand, four hundred seventy-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •