Base | Representation |
---|---|
bin | 1101001100010000001100… |
… | …0001111100100011111000 |
3 | 1220100120202112020212210001 |
4 | 3103010003001330203320 |
5 | 3400114002240303230 |
6 | 50503041135002344 |
7 | 3024614330505136 |
oct | 323040301744370 |
9 | 56316675225701 |
10 | 14504155400440 |
11 | 46921a5667a22 |
12 | 17630043693b4 |
13 | 812974c63444 |
14 | 38200d4d8756 |
15 | 1a24467510ca |
hex | d310307c8f8 |
14504155400440 has 32 divisors (see below), whose sum is σ = 33081395543280. Its totient is φ = 5722187334912.
The previous prime is 14504155400321. The next prime is 14504155400477. The reversal of 14504155400440 is 4400455140541.
It is a super-2 number, since 2×145041554004402 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 14504155400440.
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 7 ways as a sum of consecutive naturals, for example, 2483585334 + ... + 2483591173.
Almost surely, 214504155400440 is an apocalyptic number.
14504155400440 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
14504155400440 is an abundant number, since it is smaller than the sum of its proper divisors (18577240142840).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14504155400440 is a wasteful number, since it uses less digits than its factorization.
14504155400440 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4967176591 (or 4967176587 counting only the distinct ones).
The product of its (nonzero) digits is 128000, while the sum is 37.
The spelling of 14504155400440 in words is "fourteen trillion, five hundred four billion, one hundred fifty-five million, four hundred thousand, four hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •