Base | Representation |
---|---|
bin | 1011111010110101011100… |
… | …0010001001111111101000 |
3 | 1201101212100020100210121110 |
4 | 2332231113002021333220 |
5 | 3204204332240344422 |
6 | 43512312400110320 |
7 | 2521556106631551 |
oct | 276552702117750 |
9 | 51355306323543 |
10 | 13105405403112 |
11 | 41a2a757691a0 |
12 | 1577ab99053a0 |
13 | 740ab030a429 |
14 | 33443ad17328 |
15 | 17ad7d20760c |
hex | beb57089fe8 |
13105405403112 has 32 divisors (see below), whose sum is σ = 35742014736480. Its totient is φ = 3971334970560.
The previous prime is 13105405403059. The next prime is 13105405403141. The reversal of 13105405403112 is 21130450450131.
It is a self number, because there is not a number n which added to its sum of digits gives 13105405403112.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 24820843303 + ... + 24820843830.
It is an arithmetic number, because the mean of its divisors is an integer number (1116937960515).
Almost surely, 213105405403112 is an apocalyptic number.
13105405403112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
13105405403112 is an abundant number, since it is smaller than the sum of its proper divisors (22636609333368).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13105405403112 is a wasteful number, since it uses less digits than its factorization.
13105405403112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49641687153 (or 49641687149 counting only the distinct ones).
The product of its (nonzero) digits is 7200, while the sum is 30.
Adding to 13105405403112 its reverse (21130450450131), we get a palindrome (34235855853243).
The spelling of 13105405403112 in words is "thirteen trillion, one hundred five billion, four hundred five million, four hundred three thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •