Base | Representation |
---|---|
bin | 10010101110010000… |
… | …100111100010100111 |
3 | 1220220001012122002210 |
4 | 102232100213202213 |
5 | 312132441223111 |
6 | 13122502534503 |
7 | 1311116412363 |
oct | 225620474247 |
9 | 56801178083 |
10 | 20103461031 |
11 | 8586974905 |
12 | 3a90737433 |
13 | 1b84c60894 |
14 | d89d382a3 |
15 | 7c9da60a6 |
hex | 4ae4278a7 |
20103461031 has 8 divisors (see below), whose sum is σ = 26807261040. Its totient is φ = 13400984192.
The previous prime is 20103461017. The next prime is 20103461051. The reversal of 20103461031 is 13016430102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 20103461031 - 211 = 20103458983 is a prime.
It is a super-2 number, since 2×201034610312 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 20103460989 and 20103461007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20103461051) 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, 294780 + ... + 356513.
It is an arithmetic number, because the mean of its divisors is an integer number (3350907630).
Almost surely, 220103461031 is an apocalyptic number.
20103461031 is a deficient number, since it is larger than the sum of its proper divisors (6703800009).
20103461031 is a wasteful number, since it uses less digits than its factorization.
20103461031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 661585.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 20103461031 its reverse (13016430102), we get a palindrome (33119891133).
The spelling of 20103461031 in words is "twenty billion, one hundred three million, four hundred sixty-one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •