Base | Representation |
---|---|
bin | 1100110110100010000101… |
… | …1111100011101010011001 |
3 | 1212000220120222200011121020 |
4 | 3031220201133203222121 |
5 | 3323010244101341010 |
6 | 50015405504233053 |
7 | 2655634313626515 |
oct | 315504137435231 |
9 | 55026528604536 |
10 | 14131004324505 |
11 | 4558a1a601672 |
12 | 170282490b789 |
13 | 7b6717c1b123 |
14 | 36bd3108d145 |
15 | 1978a6ee9470 |
hex | cda217e3a99 |
14131004324505 has 16 divisors (see below), whose sum is σ = 22609856571264. Its totient is φ = 7536452422400.
The previous prime is 14131004324461. The next prime is 14131004324537. The reversal of 14131004324505 is 50542340013141.
It is not a de Polignac number, because 14131004324505 - 219 = 14131003800217 is a prime.
It is a super-2 number, since 2×141310043245052 (a number of 27 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3784896 + ... + 6525905.
It is an arithmetic number, because the mean of its divisors is an integer number (1413116035704).
Almost surely, 214131004324505 is an apocalyptic number.
14131004324505 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
14131004324505 is a deficient number, since it is larger than the sum of its proper divisors (8478852246759).
14131004324505 is a wasteful number, since it uses less digits than its factorization.
14131004324505 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10402176.
The product of its (nonzero) digits is 28800, while the sum is 33.
Adding to 14131004324505 its reverse (50542340013141), we get a palindrome (64673344337646).
The spelling of 14131004324505 in words is "fourteen trillion, one hundred thirty-one billion, four million, three hundred twenty-four thousand, five hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •