Base | Representation |
---|---|
bin | 10111011110011100000… |
… | …100101010001100110101 |
3 | 12201020000212010020111110 |
4 | 113132130010222030311 |
5 | 202412344142000000 |
6 | 3233035211225233 |
7 | 224360241655203 |
oct | 27363404521465 |
9 | 5636025106443 |
10 | 1613231203125 |
11 | 572192a59203 |
12 | 2207a3a48219 |
13 | b9186188809 |
14 | 5811ba3c073 |
15 | 2be6cea5850 |
hex | 1779c12a335 |
1613231203125 has 112 divisors (see below), whose sum is σ = 2852817233472. Its totient is φ = 808080000000.
The previous prime is 1613231203109. The next prime is 1613231203127. The reversal of 1613231203125 is 5213021323161.
It is not a de Polignac number, because 1613231203125 - 24 = 1613231203109 is a prime.
It is a super-2 number, since 2×16132312031252 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1613231203092 and 1613231203101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1613231203127) by changing a digit.
It is a polite number, since it can be written in 111 ways as a sum of consecutive naturals, for example, 435888775 + ... + 435892475.
Almost surely, 21613231203125 is an apocalyptic number.
1613231203125 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1613231203125 is a deficient number, since it is larger than the sum of its proper divisors (1239586030347).
1613231203125 is an frugal number, since it uses more digits than its factorization.
1613231203125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4298 (or 4273 counting only the distinct ones).
The product of its (nonzero) digits is 6480, while the sum is 30.
Adding to 1613231203125 its reverse (5213021323161), we get a palindrome (6826252526286).
The spelling of 1613231203125 in words is "one trillion, six hundred thirteen billion, two hundred thirty-one million, two hundred three thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •