Base | Representation |
---|---|
bin | 1100000100000001000000… |
… | …1110110001111100111101 |
3 | 1201221221110102111120012120 |
4 | 3001000100032301330331 |
5 | 3214300343104221000 |
6 | 44112555353553153 |
7 | 2536141521045321 |
oct | 301002016617475 |
9 | 51857412446176 |
10 | 13263131320125 |
11 | 4253953952125 |
12 | 15a2597a157b9 |
13 | 7529283a75cb |
14 | 33bd207c7981 |
15 | 1800101e26a0 |
hex | c10103b1f3d |
13263131320125 has 32 divisors (see below), whose sum is σ = 22071000766464. Its totient is φ = 7073301368000.
The previous prime is 13263131320099. The next prime is 13263131320177. The reversal of 13263131320125 is 52102313136231.
It is not a de Polignac number, because 13263131320125 - 25 = 13263131320093 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 (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 6359647 + ... + 8183603.
It is an arithmetic number, because the mean of its divisors is an integer number (689718773952).
Almost surely, 213263131320125 is an apocalyptic number.
13263131320125 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
13263131320125 is a deficient number, since it is larger than the sum of its proper divisors (8807869446339).
13263131320125 is a wasteful number, since it uses less digits than its factorization.
13263131320125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1843366 (or 1843356 counting only the distinct ones).
The product of its (nonzero) digits is 19440, while the sum is 33.
Adding to 13263131320125 its reverse (52102313136231), we get a palindrome (65365444456356).
The spelling of 13263131320125 in words is "thirteen trillion, two hundred sixty-three billion, one hundred thirty-one million, three hundred twenty thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •