Base | Representation |
---|---|
bin | 10111011011100011010… |
… | …010110111001100110001 |
3 | 12200221000210210210022110 |
4 | 113123203102313030301 |
5 | 202340022033011200 |
6 | 3231403430155533 |
7 | 224220356612352 |
oct | 27334322671461 |
9 | 5627023723273 |
10 | 1610131141425 |
11 | 570942064a44 |
12 | 2200797b2ba9 |
13 | b8ab0b3b691 |
14 | 57d06029d29 |
15 | 2bd3ac48b50 |
hex | 176e34b7331 |
1610131141425 has 48 divisors (see below), whose sum is σ = 2677271268672. Its totient is φ = 853842796800.
The previous prime is 1610131141397. The next prime is 1610131141441. The reversal of 1610131141425 is 5241411310161.
It is not a de Polignac number, because 1610131141425 - 227 = 1609996923697 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1610131141392 and 1610131141401.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 24153390 + ... + 24219960.
It is an arithmetic number, because the mean of its divisors is an integer number (55776484764).
Almost surely, 21610131141425 is an apocalyptic number.
1610131141425 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1610131141425 is a deficient number, since it is larger than the sum of its proper divisors (1067140127247).
1610131141425 is a wasteful number, since it uses less digits than its factorization.
1610131141425 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 68418 (or 68413 counting only the distinct ones).
The product of its (nonzero) digits is 2880, while the sum is 30.
Adding to 1610131141425 its reverse (5241411310161), we get a palindrome (6851542451586).
The spelling of 1610131141425 in words is "one trillion, six hundred ten billion, one hundred thirty-one million, one hundred forty-one thousand, four hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •