Base | Representation |
---|---|
bin | 11101110010011110101001… |
… | …000100110011110100011101 |
3 | 122011212122110011010022000021 |
4 | 131302132221010303310131 |
5 | 114133001013323241341 |
6 | 1142350103532032141 |
7 | 36411215021115646 |
oct | 3562365104636435 |
9 | 564778404108007 |
10 | 131012224040221 |
11 | 38820a76a974a7 |
12 | 1283b068902651 |
13 | 5814527238c04 |
14 | 244d04dca26cd |
15 | 1022dde0879d1 |
hex | 7727a9133d1d |
131012224040221 has 32 divisors (see below), whose sum is σ = 137071541652480. Its totient is φ = 125081339443200.
The previous prime is 131012224040197. The next prime is 131012224040251. The reversal of 131012224040221 is 122040422210131.
It is a cyclic number.
It is not a de Polignac number, because 131012224040221 - 211 = 131012224038173 is a prime.
It is a super-2 number, since 2×1310122240402212 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131012224040251) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 452156425 + ... + 452446081.
It is an arithmetic number, because the mean of its divisors is an integer number (4283485676640).
Almost surely, 2131012224040221 is an apocalyptic number.
It is an amenable number.
131012224040221 is a deficient number, since it is larger than the sum of its proper divisors (6059317612259).
131012224040221 is a wasteful number, since it uses less digits than its factorization.
131012224040221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 290485.
The product of its (nonzero) digits is 1536, while the sum is 25.
Adding to 131012224040221 its reverse (122040422210131), we get a palindrome (253052646250352).
The spelling of 131012224040221 in words is "one hundred thirty-one trillion, twelve billion, two hundred twenty-four million, forty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •