Base | Representation |
---|---|
bin | 1001000111010011010111… |
… | …01000001100110100110111 |
3 | 2121222000020000111212200210 |
4 | 10203221223220030310313 |
5 | 10111332232003303133 |
6 | 110343120234240503 |
7 | 4135665331342632 |
oct | 443515350146467 |
9 | 77860200455623 |
10 | 20042123103543 |
11 | 64278a8aa4202 |
12 | 22b836a586133 |
13 | b24c6c183088 |
14 | 4d40887aac19 |
15 | 24b51ce4a763 |
hex | 123a6ba0cd37 |
20042123103543 has 16 divisors (see below), whose sum is σ = 28150916976000. Its totient is φ = 12648453386400.
The previous prime is 20042123103451. The next prime is 20042123103551. The reversal of 20042123103543 is 34530132124002.
It is not a de Polignac number, because 20042123103543 - 212 = 20042123099447 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 20042123103543.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20042123103643) 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 15 ways as a sum of consecutive naturals, for example, 135058893 + ... + 135207206.
It is an arithmetic number, because the mean of its divisors is an integer number (1759432311000).
Almost surely, 220042123103543 is an apocalyptic number.
20042123103543 is a deficient number, since it is larger than the sum of its proper divisors (8108793872457).
20042123103543 is a wasteful number, since it uses less digits than its factorization.
20042123103543 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 270267422.
The product of its (nonzero) digits is 17280, while the sum is 30.
Adding to 20042123103543 its reverse (34530132124002), we get a palindrome (54572255227545).
The spelling of 20042123103543 in words is "twenty trillion, forty-two billion, one hundred twenty-three million, one hundred three thousand, five hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •