Base | Representation |
---|---|
bin | 1101001100111010001110… |
… | …1110110010001011011110 |
3 | 1220101122220001221021101201 |
4 | 3103032203232302023132 |
5 | 3400310111002143200 |
6 | 50512145102030114 |
7 | 3025464112340665 |
oct | 323164356621336 |
9 | 56348801837351 |
10 | 14515441443550 |
11 | 4696a67307183 |
12 | 1765233b7833a |
13 | 813a5320cc68 |
14 | 3827a0387ddc |
15 | 1a28a7493c6a |
hex | d33a3bb22de |
14515441443550 has 24 divisors (see below), whose sum is σ = 27573161963616. Its totient is φ = 5682640904640.
The previous prime is 14515441443539. The next prime is 14515441443551. The reversal of 14515441443550 is 5534414451541.
It is a happy number.
It is a super-2 number, since 2×145154414435502 (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 14515441443550.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14515441443551) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 3088389447 + ... + 3088394146.
It is an arithmetic number, because the mean of its divisors is an integer number (1148881748484).
Almost surely, 214515441443550 is an apocalyptic number.
14515441443550 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
14515441443550 is a deficient number, since it is larger than the sum of its proper divisors (13057720520066).
14515441443550 is a wasteful number, since it uses less digits than its factorization.
14515441443550 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6176783652 (or 6176783647 counting only the distinct ones).
The product of its (nonzero) digits is 1920000, while the sum is 46.
The spelling of 14515441443550 in words is "fourteen trillion, five hundred fifteen billion, four hundred forty-one million, four hundred forty-three thousand, five hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •