Base | Representation |
---|---|
bin | 111101000011110101… |
… | …1111100001011111001 |
3 | 110112110100200121220110 |
4 | 1322013223330023321 |
5 | 4122021104234003 |
6 | 140123241414533 |
7 | 12321261014646 |
oct | 1720753741371 |
9 | 415410617813 |
10 | 131125461753 |
11 | 506789a5210 |
12 | 214b579a449 |
13 | c4990cb930 |
14 | 64bcb54dcd |
15 | 3626a78a03 |
hex | 1e87afc2f9 |
131125461753 has 16 divisors (see below), whose sum is σ = 205399325376. Its totient is φ = 73356901440.
The previous prime is 131125461707. The next prime is 131125461793. The reversal of 131125461753 is 357164521131.
It is not a de Polignac number, because 131125461753 - 221 = 131123364601 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is not an unprimeable number, because it can be changed into a prime (131125461703) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 152826450 + ... + 152827307.
It is an arithmetic number, because the mean of its divisors is an integer number (12837457836).
Almost surely, 2131125461753 is an apocalyptic number.
131125461753 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
131125461753 is a deficient number, since it is larger than the sum of its proper divisors (74273863623).
131125461753 is a wasteful number, since it uses less digits than its factorization.
131125461753 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 305653784.
The product of its digits is 75600, while the sum is 39.
Adding to 131125461753 its reverse (357164521131), we get a palindrome (488289982884).
The spelling of 131125461753 in words is "one hundred thirty-one billion, one hundred twenty-five million, four hundred sixty-one thousand, seven hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.116 sec. • engine limits •