Base | Representation |
---|---|
bin | 1110000010101111000101… |
… | …1011101000000000100101 |
3 | 2000200001202111201012001020 |
4 | 3200223301123220000211 |
5 | 4010432423212401040 |
6 | 52501040222321353 |
7 | 3152341430106000 |
oct | 340536133500045 |
9 | 60601674635036 |
10 | 15440163012645 |
11 | 4a13155550808 |
12 | 18944a7429259 |
13 | 880002617157 |
14 | 3b5444b5a537 |
15 | 1bb979ee4cd0 |
hex | e0af16e8025 |
15440163012645 has 64 divisors (see below), whose sum is σ = 29204286835200. Its totient is φ = 6961670198784.
The previous prime is 15440163012587. The next prime is 15440163012661. The reversal of 15440163012645 is 54621036104451.
It is not a de Polignac number, because 15440163012645 - 28 = 15440163012389 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 15440163012597 and 15440163012606.
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 63 ways as a sum of consecutive naturals, for example, 20179234 + ... + 20930403.
It is an arithmetic number, because the mean of its divisors is an integer number (456316981800).
Almost surely, 215440163012645 is an apocalyptic number.
15440163012645 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
15440163012645 is a deficient number, since it is larger than the sum of its proper divisors (13764123822555).
15440163012645 is an equidigital number, since it uses as much as digits as its factorization.
15440163012645 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41109739 (or 41109725 counting only the distinct ones).
The product of its (nonzero) digits is 345600, while the sum is 42.
The spelling of 15440163012645 in words is "fifteen trillion, four hundred forty billion, one hundred sixty-three million, twelve thousand, six hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •