Base | Representation |
---|---|
bin | 1001001000111111111101… |
… | …01001000000011010011011 |
3 | 2122011120201010012102012202 |
4 | 10210133332221000122123 |
5 | 10113311132034443233 |
6 | 110430001332000415 |
7 | 4143131151104303 |
oct | 444377651003233 |
9 | 78146633172182 |
10 | 20100424140443 |
11 | 644a5a6457129 |
12 | 230771b46010b |
13 | b2a60093794a |
14 | 4d6c19768603 |
15 | 24ccd1451be8 |
hex | 1247fea4069b |
20100424140443 has 4 divisors (see below), whose sum is σ = 20103621287520. Its totient is φ = 20097226993368.
The previous prime is 20100424140439. The next prime is 20100424140449. The reversal of 20100424140443 is 34404142400102.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 20100424140443 - 22 = 20100424140439 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20100424140449) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1598564108 + ... + 1598576681.
It is an arithmetic number, because the mean of its divisors is an integer number (5025905321880).
Almost surely, 220100424140443 is an apocalyptic number.
20100424140443 is a deficient number, since it is larger than the sum of its proper divisors (3197147077).
20100424140443 is an equidigital number, since it uses as much as digits as its factorization.
20100424140443 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3197147076.
The product of its (nonzero) digits is 12288, while the sum is 29.
Adding to 20100424140443 its reverse (34404142400102), we get a palindrome (54504566540545).
The spelling of 20100424140443 in words is "twenty trillion, one hundred billion, four hundred twenty-four million, one hundred forty thousand, four hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •