Base | Representation |
---|---|
bin | 111101000000000111… |
… | …1010101000110101010 |
3 | 110112010122120222120222 |
4 | 1322000033111012222 |
5 | 4121242113134010 |
6 | 140103015450042 |
7 | 12315213025403 |
oct | 1720017250652 |
9 | 415118528528 |
10 | 131000521130 |
11 | 506144194a6 |
12 | 2147b986922 |
13 | c479264c7b |
14 | 64aa3109aa |
15 | 361aae9355 |
hex | 1e803d51aa |
131000521130 has 32 divisors (see below), whose sum is σ = 248899210560. Its totient is φ = 49642276752.
The previous prime is 131000521123. The next prime is 131000521139. The reversal of 131000521130 is 31125000131.
It is a super-2 number, since 2×1310005211302 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 131000521099 and 131000521108.
It is not an unprimeable number, because it can be changed into a prime (131000521139) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 886364 + ... + 1023543.
It is an arithmetic number, because the mean of its divisors is an integer number (7778100330).
Almost surely, 2131000521130 is an apocalyptic number.
131000521130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
131000521130 is a deficient number, since it is larger than the sum of its proper divisors (117898689430).
131000521130 is an equidigital number, since it uses as much as digits as its factorization.
131000521130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1909971 (or 1909933 counting only the distinct ones).
The product of its (nonzero) digits is 90, while the sum is 17.
Adding to 131000521130 its reverse (31125000131), we get a palindrome (162125521261).
The spelling of 131000521130 in words is "one hundred thirty-one billion, five hundred twenty-one thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •