Base | Representation |
---|---|
bin | 10001110010010011… |
… | …001000000110000000 |
3 | 1211021221021210101001 |
4 | 101302103020012000 |
5 | 303102424020241 |
6 | 12435005221344 |
7 | 1244152643602 |
oct | 216223100600 |
9 | 54257253331 |
10 | 19097485696 |
11 | 811003a733 |
12 | 384b861854 |
13 | 1a547109c3 |
14 | cd24b3172 |
15 | 76b8e4431 |
hex | 4724c8180 |
19097485696 has 32 divisors (see below), whose sum is σ = 38669489280. Its totient is φ = 9392202240.
The previous prime is 19097485691. The next prime is 19097485709. The reversal of 19097485696 is 69658479091.
It is a tau number, because it is divible by the number of its divisors (32).
It is a Harshad number since it is a multiple of its sum of digits (64).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (19097485691) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1215136 + ... + 1230751.
It is an arithmetic number, because the mean of its divisors is an integer number (1208421540).
Almost surely, 219097485696 is an apocalyptic number.
19097485696 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
19097485696 is an abundant number, since it is smaller than the sum of its proper divisors (19572003584).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
19097485696 is an equidigital number, since it uses as much as digits as its factorization.
19097485696 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2445962 (or 2445950 counting only the distinct ones).
The product of its (nonzero) digits is 29393280, while the sum is 64.
The spelling of 19097485696 in words is "nineteen billion, ninety-seven million, four hundred eighty-five thousand, six hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •