Base | Representation |
---|---|
bin | 1001010010010011010000… |
… | …01111000010111111001010 |
3 | 2200022010122112101220112211 |
4 | 10221021220033002333022 |
5 | 10134030201431100132 |
6 | 111232455035055334 |
7 | 4205204133121642 |
oct | 451115017027712 |
9 | 80263575356484 |
10 | 20420023300042 |
11 | 65630a0893093 |
12 | 23596545a154a |
13 | b517a50971c2 |
14 | 50849784d522 |
15 | 25628959e147 |
hex | 1292683c2fca |
20420023300042 has 4 divisors (see below), whose sum is σ = 30630034950066. Its totient is φ = 10210011650020.
The previous prime is 20420023299989. The next prime is 20420023300049. The reversal of 20420023300042 is 24000332002402.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in only one way, i.e., 12290219959081 + 8129803340961 = 3505741^2 + 2851281^2 .
It is a Smith number, since the sum of its digits (22) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a junction number, because it is equal to n+sod(n) for n = 20420023299986 and 20420023300022.
It is not an unprimeable number, because it can be changed into a prime (20420023300049) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5105005825009 + ... + 5105005825012.
Almost surely, 220420023300042 is an apocalyptic number.
20420023300042 is a deficient number, since it is larger than the sum of its proper divisors (10210011650024).
20420023300042 is a wasteful number, since it uses less digits than its factorization.
20420023300042 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10210011650023.
The product of its (nonzero) digits is 2304, while the sum is 22.
Adding to 20420023300042 its reverse (24000332002402), we get a palindrome (44420355302444).
The spelling of 20420023300042 in words is "twenty trillion, four hundred twenty billion, twenty-three million, three hundred thousand, forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •