Base | Representation |
---|---|
bin | 1001001010001010000110… |
… | …10001111101000100101101 |
3 | 2122022101110021202111100012 |
4 | 10211011003101331010231 |
5 | 10114434142442243041 |
6 | 110500143310543005 |
7 | 4146040454020511 |
oct | 445050321750455 |
9 | 78271407674305 |
10 | 20140230431021 |
11 | 6465473029438 |
12 | 231338a507a65 |
13 | b312a582623c |
14 | 4d8b14310141 |
15 | 24dd60e233eb |
hex | 12514347d12d |
20140230431021 has 4 divisors (see below), whose sum is σ = 20382883809792. Its totient is φ = 19897577052252.
The previous prime is 20140230431017. The next prime is 20140230431039. The reversal of 20140230431021 is 12013403204102.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 20140230431021 - 22 = 20140230431017 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20140230431521) 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, 121326689261 + ... + 121326689426.
It is an arithmetic number, because the mean of its divisors is an integer number (5095720952448).
Almost surely, 220140230431021 is an apocalyptic number.
It is an amenable number.
20140230431021 is a deficient number, since it is larger than the sum of its proper divisors (242653378771).
20140230431021 is an equidigital number, since it uses as much as digits as its factorization.
20140230431021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 242653378770.
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 20140230431021 its reverse (12013403204102), we get a palindrome (32153633635123).
The spelling of 20140230431021 in words is "twenty trillion, one hundred forty billion, two hundred thirty million, four hundred thirty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •