Base | Representation |
---|---|
bin | 111101000110011001… |
… | …0010100101101000011 |
3 | 110112200022200111022000 |
4 | 1322030302110231003 |
5 | 4122210010133443 |
6 | 140135535315043 |
7 | 12323350164120 |
oct | 1721462245503 |
9 | 415608614260 |
10 | 131211021123 |
11 | 50712223236 |
12 | 2151a37ba83 |
13 | c4b0a57590 |
14 | 64ca267747 |
15 | 362e3298d3 |
hex | 1e8cc94b43 |
131211021123 has 128 divisors (see below), whose sum is σ = 252818227200. Its totient is φ = 65312148096.
The previous prime is 131211021113. The next prime is 131211021187. The reversal of 131211021123 is 321120112131.
It is not a de Polignac number, because 131211021123 - 26 = 131211021059 is a prime.
It is a super-2 number, since 2×1312110211232 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 131211021096 and 131211021105.
It is not an unprimeable number, because it can be changed into a prime (131211021113) by changing a digit.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 12272286 + ... + 12282972.
It is an arithmetic number, because the mean of its divisors is an integer number (1975142400).
Almost surely, 2131211021123 is an apocalyptic number.
131211021123 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
131211021123 is a deficient number, since it is larger than the sum of its proper divisors (121607206077).
131211021123 is a wasteful number, since it uses less digits than its factorization.
131211021123 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10998 (or 10992 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 18.
Adding to 131211021123 its reverse (321120112131), we get a palindrome (452331133254).
The spelling of 131211021123 in words is "one hundred thirty-one billion, two hundred eleven million, twenty-one thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •