Base | Representation |
---|---|
bin | 1000101100101110010010… |
… | …00111001000001100110100 |
3 | 2111201200221101101000102002 |
4 | 10112113021013020030310 |
5 | 10001401403021124400 |
6 | 104403402322434432 |
7 | 4013005032420644 |
oct | 426271107101464 |
9 | 74650841330362 |
10 | 19128863458100 |
11 | 6105561808550 |
12 | 218b375802a18 |
13 | a89ac85b6526 |
14 | 4a1bb038c524 |
15 | 2328bb7ceed5 |
hex | 1165c91c8334 |
19128863458100 has 72 divisors (see below), whose sum is σ = 45364536671328. Its totient is φ = 6943461884800.
The previous prime is 19128863458093. The next prime is 19128863458139. The reversal of 19128863458100 is 185436882191.
It is a super-2 number, since 2×191288634581002 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 14997602 + ... + 16223001.
It is an arithmetic number, because the mean of its divisors is an integer number (630063009324).
Almost surely, 219128863458100 is an apocalyptic number.
19128863458100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
19128863458100 is an abundant number, since it is smaller than the sum of its proper divisors (26235673213228).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
19128863458100 is a wasteful number, since it uses less digits than its factorization.
19128863458100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31221185 (or 31221178 counting only the distinct ones).
The product of its (nonzero) digits is 3317760, while the sum is 56.
The spelling of 19128863458100 in words is "nineteen trillion, one hundred twenty-eight billion, eight hundred sixty-three million, four hundred fifty-eight thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •