Base | Representation |
---|---|
bin | 11101110011111001111010… |
… | …110000001010010001000011 |
3 | 122012020000102102201221210110 |
4 | 131303321322300022101003 |
5 | 114141102223131414021 |
6 | 1142503113024002403 |
7 | 36421254515432130 |
oct | 3563717260122103 |
9 | 565200372657713 |
10 | 131110231123011 |
11 | 3885959a483388 |
12 | 1285605b160403 |
13 | 5820845bb10aa |
14 | 2453aaa38d587 |
15 | 102572835d476 |
hex | 773e7ac0a443 |
131110231123011 has 32 divisors (see below), whose sum is σ = 200697301905408. Its totient is φ = 74578824069120.
The previous prime is 131110231123009. The next prime is 131110231123019. The reversal of 131110231123011 is 110321132011131.
It is not a de Polignac number, because 131110231123011 - 21 = 131110231123009 is a prime.
It is a super-2 number, since 2×1311102311230112 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is not an unprimeable number, because it can be changed into a prime (131110231123019) 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, 64833091 + ... + 66824771.
It is an arithmetic number, because the mean of its divisors is an integer number (6271790684544).
Almost surely, 2131110231123011 is an apocalyptic number.
131110231123011 is a deficient number, since it is larger than the sum of its proper divisors (69587070782397).
131110231123011 is a wasteful number, since it uses less digits than its factorization.
131110231123011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2005971.
The product of its (nonzero) digits is 108, while the sum is 21.
Adding to 131110231123011 its reverse (110321132011131), we get a palindrome (241431363134142).
The spelling of 131110231123011 in words is "one hundred thirty-one trillion, one hundred ten billion, two hundred thirty-one million, one hundred twenty-three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •