Base | Representation |
---|---|
bin | 1011111011110101001000… |
… | …0101011110000110011101 |
3 | 1201110111110202002212100020 |
4 | 2332331102011132012131 |
5 | 3204444341034130010 |
6 | 43524221101022353 |
7 | 2523032560524033 |
oct | 276752205360635 |
9 | 51414422085306 |
10 | 13122502255005 |
11 | 41aa249469060 |
12 | 157b28b5549b9 |
13 | 7425a63b1440 |
14 | 3351bd808553 |
15 | 17b52e161470 |
hex | bef5215e19d |
13122502255005 has 128 divisors (see below), whose sum is σ = 25695945031680. Its totient is φ = 5631410304000.
The previous prime is 13122502254997. The next prime is 13122502255039. The reversal of 13122502255005 is 50055220522131.
It is not a de Polignac number, because 13122502255005 - 23 = 13122502254997 is a prime.
It is a super-2 number, since 2×131225022550052 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 6342700 + ... + 8153210.
It is an arithmetic number, because the mean of its divisors is an integer number (200749570560).
Almost surely, 213122502255005 is an apocalyptic number.
13122502255005 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
13122502255005 is a deficient number, since it is larger than the sum of its proper divisors (12573442776675).
13122502255005 is a wasteful number, since it uses less digits than its factorization.
13122502255005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1810683.
The product of its (nonzero) digits is 30000, while the sum is 33.
Adding to 13122502255005 its reverse (50055220522131), we get a palindrome (63177722777136).
The spelling of 13122502255005 in words is "thirteen trillion, one hundred twenty-two billion, five hundred two million, two hundred fifty-five thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •