Base | Representation |
---|---|
bin | 1100001101011010001011… |
… | …0111010100111001011001 |
3 | 1202112100222211221200020110 |
4 | 3003112202313110321121 |
5 | 3224421341313300010 |
6 | 44315044344314533 |
7 | 2553613516356552 |
oct | 303264267247131 |
9 | 52470884850213 |
10 | 13424505212505 |
11 | 4306334241a32 |
12 | 1609913772a49 |
13 | 764c051815aa |
14 | 345a6c975329 |
15 | 1843075b9120 |
hex | c35a2dd4e59 |
13424505212505 has 16 divisors (see below), whose sum is σ = 22219870697280. Its totient is φ = 6912848660928.
The previous prime is 13424505212501. The next prime is 13424505212539. The reversal of 13424505212505 is 50521250542431.
It is not a de Polignac number, because 13424505212505 - 22 = 13424505212501 is a prime.
It is not an unprimeable number, because it can be changed into a prime (13424505212501) by changing a digit.
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, 15430465327 + ... + 15430466196.
It is an arithmetic number, because the mean of its divisors is an integer number (1388741918580).
Almost surely, 213424505212505 is an apocalyptic number.
13424505212505 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
13424505212505 is a deficient number, since it is larger than the sum of its proper divisors (8795365484775).
13424505212505 is a wasteful number, since it uses less digits than its factorization.
13424505212505 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30860931560.
The product of its (nonzero) digits is 240000, while the sum is 39.
Adding to 13424505212505 its reverse (50521250542431), we get a palindrome (63945755754936).
The spelling of 13424505212505 in words is "thirteen trillion, four hundred twenty-four billion, five hundred five million, two hundred twelve thousand, five hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •