Base | Representation |
---|---|
bin | 1001001001110000010110… |
… | …10110010010010001001111 |
3 | 2122021001202220210120111122 |
4 | 10210320023112102101033 |
5 | 10114222340211443211 |
6 | 110445535505511155 |
7 | 4145041063003664 |
oct | 444701326222117 |
9 | 78231686716448 |
10 | 20126407140431 |
11 | 645a61a155639 |
12 | 23107710424bb |
13 | b2cbb1a08557 |
14 | 4d81a24b5a6b |
15 | 24d8025986db |
hex | 124e0b59244f |
20126407140431 has 4 divisors (see below), whose sum is σ = 20130959600664. Its totient is φ = 20121854680200.
The previous prime is 20126407140421. The next prime is 20126407140449. The reversal of 20126407140431 is 13404170462102.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20126407140431 is a prime.
It is a super-2 number, since 2×201264071404312 (a number of 27 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 = 20126407140391 and 20126407140400.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20126407140421) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2276223485 + ... + 2276232326.
It is an arithmetic number, because the mean of its divisors is an integer number (5032739900166).
Almost surely, 220126407140431 is an apocalyptic number.
20126407140431 is a deficient number, since it is larger than the sum of its proper divisors (4552460233).
20126407140431 is an equidigital number, since it uses as much as digits as its factorization.
20126407140431 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4552460232.
The product of its (nonzero) digits is 32256, while the sum is 35.
The spelling of 20126407140431 in words is "twenty trillion, one hundred twenty-six billion, four hundred seven million, one hundred forty thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •