Base | Representation |
---|---|
bin | 1010011110000000001100… |
… | …11001110010111100100011 |
3 | 10000111210120021120022200021 |
4 | 11033000012121302330203 |
5 | 11004134234311212011 |
6 | 120543432340334311 |
7 | 4564136054314450 |
oct | 517000631627443 |
9 | 100453507508607 |
10 | 23021132132131 |
11 | 7376230a24421 |
12 | 26b97966a4397 |
13 | cacb63c0c823 |
14 | 59832b940827 |
15 | 29dc74927471 |
hex | 14f006672f23 |
23021132132131 has 16 divisors (see below), whose sum is σ = 26606256952320. Its totient is φ = 19510118147520.
The previous prime is 23021132132129. The next prime is 23021132132189. The reversal of 23021132132131 is 13123123112032.
It is not a de Polignac number, because 23021132132131 - 21 = 23021132132129 is a prime.
It is a super-2 number, since 2×230211321321312 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 23021132132096 and 23021132132105.
It is not an unprimeable number, because it can be changed into a prime (23021132132101) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 21590310 + ... + 22631476.
It is an arithmetic number, because the mean of its divisors is an integer number (1662891059520).
Almost surely, 223021132132131 is an apocalyptic number.
23021132132131 is a deficient number, since it is larger than the sum of its proper divisors (3585124820189).
23021132132131 is a wasteful number, since it uses less digits than its factorization.
23021132132131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1076754.
The product of its (nonzero) digits is 1296, while the sum is 25.
Adding to 23021132132131 its reverse (13123123112032), we get a palindrome (36144255244163).
The spelling of 23021132132131 in words is "twenty-three trillion, twenty-one billion, one hundred thirty-two million, one hundred thirty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •