Base | Representation |
---|---|
bin | 10010111101101101111… |
… | …110111110000100111001 |
3 | 11121120211122221101010210 |
4 | 102331231332332010321 |
5 | 132322443400030200 |
6 | 2434405142101333 |
7 | 163104004620231 |
oct | 22755576760471 |
9 | 4546748841123 |
10 | 1303220314425 |
11 | 462768990077 |
12 | 1906a5a1a849 |
13 | 95b7c329533 |
14 | 4710d140cc1 |
15 | 23d769d7650 |
hex | 12f6dfbe139 |
1303220314425 has 48 divisors (see below), whose sum is σ = 2171788996608. Its totient is φ = 689527924800.
The previous prime is 1303220314391. The next prime is 1303220314427. The reversal of 1303220314425 is 5244130223031.
It is not a de Polignac number, because 1303220314425 - 211 = 1303220312377 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1303220314392 and 1303220314401.
It is not an unprimeable number, because it can be changed into a prime (1303220314427) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 34004824 + ... + 34043126.
It is an arithmetic number, because the mean of its divisors is an integer number (45245604096).
Almost surely, 21303220314425 is an apocalyptic number.
1303220314425 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1303220314425 is a deficient number, since it is larger than the sum of its proper divisors (868568682183).
1303220314425 is a wasteful number, since it uses less digits than its factorization.
1303220314425 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 41910 (or 41905 counting only the distinct ones).
The product of its (nonzero) digits is 17280, while the sum is 30.
Adding to 1303220314425 its reverse (5244130223031), we get a palindrome (6547350537456).
The spelling of 1303220314425 in words is "one trillion, three hundred three billion, two hundred twenty million, three hundred fourteen thousand, four hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •