Base | Representation |
---|---|
bin | 1001001001100100100000… |
… | …00101001110000110011010 |
3 | 2122020110100110121201210011 |
4 | 10210302100011032012122 |
5 | 10114121322242231132 |
6 | 110443004243512134 |
7 | 4144424310035443 |
oct | 444622005160632 |
9 | 78213313551704 |
10 | 20120044102042 |
11 | 6457954404725 |
12 | 230b49608864a |
13 | b2c40966ca91 |
14 | 4d7b5b3a42ca |
15 | 24d57db4db47 |
hex | 124c9014e19a |
20120044102042 has 4 divisors (see below), whose sum is σ = 30180066153066. Its totient is φ = 10060022051020.
The previous prime is 20120044102033. The next prime is 20120044102049. The reversal of 20120044102042 is 24020144002102.
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., 17264515293481 + 2855528808561 = 4155059^2 + 1689831^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 not an unprimeable number, because it can be changed into a prime (20120044102049) 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 as a sum of consecutive naturals, namely, 5030011025509 + ... + 5030011025512.
Almost surely, 220120044102042 is an apocalyptic number.
20120044102042 is a deficient number, since it is larger than the sum of its proper divisors (10060022051024).
20120044102042 is a wasteful number, since it uses less digits than its factorization.
20120044102042 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10060022051023.
The product of its (nonzero) digits is 1024, while the sum is 22.
Adding to 20120044102042 its reverse (24020144002102), we get a palindrome (44140188104144).
The spelling of 20120044102042 in words is "twenty trillion, one hundred twenty billion, forty-four million, one hundred two thousand, forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •