Base | Representation |
---|---|
bin | 10010110000011101… |
… | …010100001011101011 |
3 | 1220222121121111002021 |
4 | 102300131110023223 |
5 | 312221412002133 |
6 | 13130301245311 |
7 | 1312045046131 |
oct | 226035241353 |
9 | 56877544067 |
10 | 20140344043 |
11 | 85a5776636 |
12 | 3aa0b63837 |
13 | 1b8c7a5751 |
14 | d90bb9751 |
15 | 7cd23e52d |
hex | 4b07542eb |
20140344043 has 4 divisors (see below), whose sum is σ = 20140716960. Its totient is φ = 20139971128.
The previous prime is 20140344019. The next prime is 20140344113. The reversal of 20140344043 is 34044304102.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 34044304102 = 2 ⋅17022152051.
It is a cyclic number.
It is not a de Polignac number, because 20140344043 - 225 = 20106789611 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20140343999 and 20140344017.
It is not an unprimeable number, because it can be changed into a prime (20140344143) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 88180 + ... + 219217.
It is an arithmetic number, because the mean of its divisors is an integer number (5035179240).
Almost surely, 220140344043 is an apocalyptic number.
20140344043 is a deficient number, since it is larger than the sum of its proper divisors (372917).
20140344043 is an equidigital number, since it uses as much as digits as its factorization.
20140344043 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 372916.
The product of its (nonzero) digits is 4608, while the sum is 25.
Adding to 20140344043 its reverse (34044304102), we get a palindrome (54184648145).
The spelling of 20140344043 in words is "twenty billion, one hundred forty million, three hundred forty-four thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •