Base | Representation |
---|---|
bin | 11110111001011110110… |
… | …010000001000100110011 |
3 | 21111222121201002202210021 |
4 | 132321132302001010303 |
5 | 234242011311423011 |
6 | 4303233221544311 |
7 | 306255311221516 |
oct | 36713662010463 |
9 | 7458551082707 |
10 | 2123304014131 |
11 | 7495408416a3 |
12 | 2a3616275097 |
13 | 1252c4107b91 |
14 | 74aa8938d7d |
15 | 3a37307a471 |
hex | 1ee5ec81133 |
2123304014131 has 6 divisors (see below), whose sum is σ = 2240938585932. Its totient is φ = 2011551170940.
The previous prime is 2123304014089. The next prime is 2123304014141. The reversal of 2123304014131 is 1314104033212.
It is not a de Polignac number, because 2123304014131 - 223 = 2123295625523 is a prime.
It is a super-2 number, since 2×21233040141312 (a number of 25 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 = 2123304014096 and 2123304014105.
It is not an unprimeable number, because it can be changed into a prime (2123304014141) 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, 2940863925 + ... + 2940864646.
It is an arithmetic number, because the mean of its divisors is an integer number (373489764322).
Almost surely, 22123304014131 is an apocalyptic number.
2123304014131 is a deficient number, since it is larger than the sum of its proper divisors (117634571801).
2123304014131 is an equidigital number, since it uses as much as digits as its factorization.
2123304014131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5881728609 (or 5881728590 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 2123304014131 its reverse (1314104033212), we get a palindrome (3437408047343).
The spelling of 2123304014131 in words is "two trillion, one hundred twenty-three billion, three hundred four million, fourteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •