Base | Representation |
---|---|
bin | 111101001010001111… |
… | …0011010100110011001 |
3 | 110120000022102022122200 |
4 | 1322110132122212121 |
5 | 4122441021120441 |
6 | 140200424240413 |
7 | 12326504515362 |
oct | 1722436324631 |
9 | 416008368580 |
10 | 131340020121 |
11 | 50779021082 |
12 | 21555610109 |
13 | c5016b254b |
14 | 64dd446b69 |
15 | 363a80b7b6 |
hex | 1e9479a999 |
131340020121 has 6 divisors (see below), whose sum is σ = 189713362410. Its totient is φ = 87560013408.
The previous prime is 131340020089. The next prime is 131340020209. The reversal of 131340020121 is 121020043131.
It can be written as a sum of positive squares in only one way, i.e., 108283116096 + 23056904025 = 329064^2 + 151845^2 .
It is not a de Polignac number, because 131340020121 - 25 = 131340020089 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 131340020094 and 131340020103.
It is not an unprimeable number, because it can be changed into a prime (131340020921) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 7296667776 + ... + 7296667793.
It is an arithmetic number, because the mean of its divisors is an integer number (31618893735).
Almost surely, 2131340020121 is an apocalyptic number.
It is an amenable number.
131340020121 is a deficient number, since it is larger than the sum of its proper divisors (58373342289).
131340020121 is a wasteful number, since it uses less digits than its factorization.
131340020121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14593335575 (or 14593335572 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 131340020121 its reverse (121020043131), we get a palindrome (252360063252).
The spelling of 131340020121 in words is "one hundred thirty-one billion, three hundred forty million, twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •