Base | Representation |
---|---|
bin | 10010101111100100… |
… | …101100001010001011 |
3 | 1220221120200022221111 |
4 | 102233210230022023 |
5 | 312204112000133 |
6 | 13125011151151 |
7 | 1311504633145 |
oct | 225744541213 |
9 | 56846608844 |
10 | 20125500043 |
11 | 8598358070 |
12 | 3a97ba54b7 |
13 | 1b896a910c |
14 | d8cc33c95 |
15 | 7cbcab1cd |
hex | 4af92c28b |
20125500043 has 8 divisors (see below), whose sum is σ = 22909660416. Its totient is φ = 17500434600.
The previous prime is 20125500023. The next prime is 20125500047. The reversal of 20125500043 is 34000552102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-20125500043 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20125499987 and 20125500023.
It is not an unprimeable number, because it can be changed into a prime (20125500047) 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 7 ways as a sum of consecutive naturals, for example, 39773463 + ... + 39773968.
It is an arithmetic number, because the mean of its divisors is an integer number (2863707552).
Almost surely, 220125500043 is an apocalyptic number.
20125500043 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
20125500043 is a deficient number, since it is larger than the sum of its proper divisors (2784160373).
20125500043 is a wasteful number, since it uses less digits than its factorization.
20125500043 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 79547465.
The product of its (nonzero) digits is 1200, while the sum is 22.
It can be divided in two parts, 2012 and 5500043, that added together give a palindrome (5502055).
The spelling of 20125500043 in words is "twenty billion, one hundred twenty-five million, five hundred thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •