Base | Representation |
---|---|
bin | 1011111010101110011001… |
… | …0111101011100000100101 |
3 | 1201101200110111122112211201 |
4 | 2332223212113223200211 |
5 | 3204141444344020010 |
6 | 43511401035002501 |
7 | 2521461215426620 |
oct | 276534627534045 |
9 | 51350414575751 |
10 | 13103515220005 |
11 | 41a21958086a1 |
12 | 1577670899431 |
13 | 74086b832ca2 |
14 | 3342dbc86db7 |
15 | 17acbc2d823a |
hex | beae65eb825 |
13103515220005 has 32 divisors (see below), whose sum is σ = 18551862097920. Its totient is φ = 8694655119360.
The previous prime is 13103515219987. The next prime is 13103515220009. The reversal of 13103515220005 is 50002251530131.
It is not a de Polignac number, because 13103515220005 - 233 = 13094925285413 is a prime.
It is a super-2 number, since 2×131035152200052 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13103515220009) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 11939977 + ... + 12991153.
It is an arithmetic number, because the mean of its divisors is an integer number (579745690560).
Almost surely, 213103515220005 is an apocalyptic number.
It is an amenable number.
13103515220005 is a deficient number, since it is larger than the sum of its proper divisors (5448346877915).
13103515220005 is a wasteful number, since it uses less digits than its factorization.
13103515220005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1062709.
The product of its (nonzero) digits is 4500, while the sum is 28.
Adding to 13103515220005 its reverse (50002251530131), we get a palindrome (63105766750136).
It can be divided in two parts, 1310351 and 5220005, that added together give a palindrome (6530356).
The spelling of 13103515220005 in words is "thirteen trillion, one hundred three billion, five hundred fifteen million, two hundred twenty thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.103 sec. • engine limits •