Base | Representation |
---|---|
bin | 1011111011001110000000… |
… | …1011111110111011100101 |
3 | 1201102111100220221102210001 |
4 | 2332303200023332323211 |
5 | 3204311334331101000 |
6 | 43515323103501301 |
7 | 2522211422120461 |
oct | 276634013767345 |
9 | 51374326842701 |
10 | 13112001425125 |
11 | 41a584aa80159 |
12 | 157923a8b7831 |
13 | 7415c1a0b235 |
14 | 3348a4d554a1 |
15 | 17b11732446a |
hex | bece02feee5 |
13112001425125 has 16 divisors (see below), whose sum is σ = 16364152389312. Its totient is φ = 10489361005200.
The previous prime is 13112001425123. The next prime is 13112001425137. The reversal of 13112001425125 is 52152410021131.
It is not a de Polignac number, because 13112001425125 - 21 = 13112001425123 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13112001425093 and 13112001425102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13112001425123) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4384954 + ... + 6741796.
It is an arithmetic number, because the mean of its divisors is an integer number (1022759524332).
Almost surely, 213112001425125 is an apocalyptic number.
It is an amenable number.
13112001425125 is a deficient number, since it is larger than the sum of its proper divisors (3252150964187).
13112001425125 is an equidigital number, since it uses as much as digits as its factorization.
13112001425125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2401365 (or 2401355 counting only the distinct ones).
The product of its (nonzero) digits is 2400, while the sum is 28.
Adding to 13112001425125 its reverse (52152410021131), we get a palindrome (65264411446256).
The spelling of 13112001425125 in words is "thirteen trillion, one hundred twelve billion, one million, four hundred twenty-five thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •