Base | Representation |
---|---|
bin | 111101000000011001… |
… | …1100010011101011101 |
3 | 110112011022110020000111 |
4 | 1322000303202131131 |
5 | 4121302030404041 |
6 | 140103555130021 |
7 | 12315356510506 |
oct | 1720063423535 |
9 | 415138406014 |
10 | 131010013021 |
11 | 50619811938 |
12 | 21482ba3911 |
13 | c47b209484 |
14 | 64ab6a1bad |
15 | 361b871981 |
hex | 1e80ce275d |
131010013021 has 8 divisors (see below), whose sum is σ = 132866395200. Its totient is φ = 129153941280.
The previous prime is 131010013007. The next prime is 131010013039. The reversal of 131010013021 is 120310010131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 131010013021 - 211 = 131010010973 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 131010012992 and 131010013010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131010013061) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 850425 + ... + 992593.
It is an arithmetic number, because the mean of its divisors is an integer number (16608299400).
Almost surely, 2131010013021 is an apocalyptic number.
It is an amenable number.
131010013021 is a deficient number, since it is larger than the sum of its proper divisors (1856382179).
131010013021 is a wasteful number, since it uses less digits than its factorization.
131010013021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 155219.
The product of its (nonzero) digits is 18, while the sum is 13.
Adding to 131010013021 its reverse (120310010131), we get a palindrome (251320023152).
The spelling of 131010013021 in words is "one hundred thirty-one billion, ten million, thirteen thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •