Base | Representation |
---|---|
bin | 1100001101111111011111… |
… | …0110100110011100110111 |
3 | 1202120022211212110102110120 |
4 | 3003133313312212130313 |
5 | 3230102344340121330 |
6 | 44323422254023023 |
7 | 2554416645340251 |
oct | 303376766463467 |
9 | 52508755412416 |
10 | 13434521020215 |
11 | 430a603973569 |
12 | 160b849aa7a73 |
13 | 765b40214c29 |
14 | 34633cc50cd1 |
15 | 1846e1a4ac10 |
hex | c37f7da6737 |
13434521020215 has 8 divisors (see below), whose sum is σ = 21495233632368. Its totient is φ = 7165077877440.
The previous prime is 13434521020183. The next prime is 13434521020253. The reversal of 13434521020215 is 51202012543431.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 13434521020215 - 25 = 13434521020183 is a prime.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 447817367326 + ... + 447817367355.
It is an arithmetic number, because the mean of its divisors is an integer number (2686904204046).
Almost surely, 213434521020215 is an apocalyptic number.
13434521020215 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
13434521020215 is a deficient number, since it is larger than the sum of its proper divisors (8060712612153).
13434521020215 is an equidigital number, since it uses as much as digits as its factorization.
13434521020215 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 895634734689.
The product of its (nonzero) digits is 28800, while the sum is 33.
Adding to 13434521020215 its reverse (51202012543431), we get a palindrome (64636533563646).
The spelling of 13434521020215 in words is "thirteen trillion, four hundred thirty-four billion, five hundred twenty-one million, twenty thousand, two hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •