Base | Representation |
---|---|
bin | 10010011101011010… |
… | …110001000101111011 |
3 | 1220011100112111110220 |
4 | 102131122301011323 |
5 | 311043123041143 |
6 | 13034450511123 |
7 | 1301115642324 |
oct | 223532610573 |
9 | 56140474426 |
10 | 19820908923 |
11 | 8451428272 |
12 | 3a11b954a3 |
13 | 1b3b56169a |
14 | d605c744b |
15 | 7b0191d83 |
hex | 49d6b117b |
19820908923 has 64 divisors (see below), whose sum is σ = 29216194560. Its totient is φ = 11902464000.
The previous prime is 19820908903. The next prime is 19820908969. The reversal of 19820908923 is 32980902891.
It is not a de Polignac number, because 19820908923 - 29 = 19820908411 is a prime.
It is a super-2 number, since 2×198209089232 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (51).
It is not an unprimeable number, because it can be changed into a prime (19820908903) 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 63 ways as a sum of consecutive naturals, for example, 26820888 + ... + 26821626.
It is an arithmetic number, because the mean of its divisors is an integer number (456503040).
Almost surely, 219820908923 is an apocalyptic number.
19820908923 is a deficient number, since it is larger than the sum of its proper divisors (9395285637).
19820908923 is a wasteful number, since it uses less digits than its factorization.
19820908923 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1028.
The product of its (nonzero) digits is 559872, while the sum is 51.
The spelling of 19820908923 in words is "nineteen billion, eight hundred twenty million, nine hundred eight thousand, nine hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •