Base | Representation |
---|---|
bin | 1100010010100101001110… |
… | …0001110001001000100011 |
3 | 1202211212100212212002111010 |
4 | 3010221103201301020203 |
5 | 3232400334312133042 |
6 | 44423542240352003 |
7 | 2563210603545243 |
oct | 304512341611043 |
9 | 52755325762433 |
10 | 13513368474147 |
11 | 433aa95235733 |
12 | 1622b93915603 |
13 | 7703c762bb09 |
14 | 34a09c8cdb23 |
15 | 1867a8c5459c |
hex | c4a53871223 |
13513368474147 has 8 divisors (see below), whose sum is σ = 19077696669456. Its totient is φ = 8478976297472.
The previous prime is 13513368474097. The next prime is 13513368474217. The reversal of 13513368474147 is 74147486331531.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 13513368474147 - 26 = 13513368474083 is a prime.
It is a super-2 number, since 2×135133684741472 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (13513368424147) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 132484004598 + ... + 132484004699.
It is an arithmetic number, because the mean of its divisors is an integer number (2384712083682).
Almost surely, 213513368474147 is an apocalyptic number.
13513368474147 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
13513368474147 is a deficient number, since it is larger than the sum of its proper divisors (5564328195309).
13513368474147 is a wasteful number, since it uses less digits than its factorization.
13513368474147 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 264968009317.
The product of its digits is 20321280, while the sum is 57.
The spelling of 13513368474147 in words is "thirteen trillion, five hundred thirteen billion, three hundred sixty-eight million, four hundred seventy-four thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •