Base | Representation |
---|---|
bin | 1000101001001000110010… |
… | …10111000011100100000000 |
3 | 2111021220220211100102010010 |
4 | 10110210121113003210000 |
5 | 4442342040333242404 |
6 | 104231024442104520 |
7 | 4001053603311300 |
oct | 424443127034400 |
9 | 74256824312103 |
10 | 19005655759104 |
11 | 6068287221723 |
12 | 216b50b7ab140 |
13 | a7b2c1996221 |
14 | 499c43015600 |
15 | 22e5a9e0a189 |
hex | 1149195c3900 |
19005655759104 has 216 divisors, whose sum is σ = 58850255321760. Its totient is φ = 5429349015552.
The previous prime is 19005655759087. The next prime is 19005655759117. The reversal of 19005655759104 is 40195755650091.
It is a happy number.
It is a super-2 number, since 2×190056557591042 (a number of 27 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 268243107 + ... + 268313949.
Almost surely, 219005655759104 is an apocalyptic number.
19005655759104 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 19005655759104, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (29425127660880).
19005655759104 is an abundant number, since it is smaller than the sum of its proper divisors (39844599562656).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
19005655759104 is an equidigital number, since it uses as much as digits as its factorization.
19005655759104 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 78005 (or 77984 counting only the distinct ones).
The product of its (nonzero) digits is 8505000, while the sum is 57.
The spelling of 19005655759104 in words is "nineteen trillion, five billion, six hundred fifty-five million, seven hundred fifty-nine thousand, one hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •