Base | Representation |
---|---|
bin | 111101000000110110… |
… | …1001101011000001101 |
3 | 110112012100220022000102 |
4 | 1322001231031120031 |
5 | 4121314413143041 |
6 | 140105255140445 |
7 | 12315632144351 |
oct | 1720155153015 |
9 | 415170808012 |
10 | 131025131021 |
11 | 506272a8254 |
12 | 21488074725 |
13 | c4813a0735 |
14 | 64ad6b9461 |
15 | 361cd5b09b |
hex | 1e81b4d60d |
131025131021 has 4 divisors (see below), whose sum is σ = 136721875872. Its totient is φ = 125328386172.
The previous prime is 131025131011. The next prime is 131025131093. The reversal of 131025131021 is 120131520131.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 131025131021 - 234 = 113845261837 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 131025130984 and 131025131002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131025131011) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2848372391 + ... + 2848372436.
It is an arithmetic number, because the mean of its divisors is an integer number (34180468968).
Almost surely, 2131025131021 is an apocalyptic number.
It is an amenable number.
131025131021 is a deficient number, since it is larger than the sum of its proper divisors (5696744851).
131025131021 is an equidigital number, since it uses as much as digits as its factorization.
131025131021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5696744850.
The product of its (nonzero) digits is 180, while the sum is 20.
Adding to 131025131021 its reverse (120131520131), we get a palindrome (251156651152).
The spelling of 131025131021 in words is "one hundred thirty-one billion, twenty-five million, one hundred thirty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •