Base | Representation |
---|---|
bin | 1000101001010101000100… |
… | …10010101010011110010111 |
3 | 2111022112221020220200011120 |
4 | 10110222202102222132113 |
5 | 4442444041000204110 |
6 | 104234034533535023 |
7 | 4001406142014033 |
oct | 424524222523627 |
9 | 74275836820146 |
10 | 19012248053655 |
11 | 607005a41813a |
12 | 217084b4a4473 |
13 | a7bb0269052c |
14 | 49a2aa7631c3 |
15 | 22e843a3c870 |
hex | 114aa24aa797 |
19012248053655 has 8 divisors (see below), whose sum is σ = 30419596885872. Its totient is φ = 10139865628608.
The previous prime is 19012248053627. The next prime is 19012248053663. The reversal of 19012248053655 is 55635084221091.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 19012248053655 - 223 = 19012239665047 is a prime.
It is a super-2 number, since 2×190122480536552 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 19012248053598 and 19012248053607.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 633741601774 + ... + 633741601803.
It is an arithmetic number, because the mean of its divisors is an integer number (3802449610734).
Almost surely, 219012248053655 is an apocalyptic number.
19012248053655 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
19012248053655 is a deficient number, since it is larger than the sum of its proper divisors (11407348832217).
19012248053655 is a wasteful number, since it uses less digits than its factorization.
19012248053655 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1267483203585.
The product of its (nonzero) digits is 2592000, while the sum is 51.
The spelling of 19012248053655 in words is "nineteen trillion, twelve billion, two hundred forty-eight million, fifty-three thousand, six hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •