Base | Representation |
---|---|
bin | 1001100100010110000111… |
… | …0100111000101001111011 |
3 | 1101020201000000101022121010 |
4 | 2121011201310320221323 |
5 | 2334324443114131103 |
6 | 34212455000045003 |
7 | 2134021543651440 |
oct | 231054164705173 |
9 | 41221000338533 |
10 | 10520016161403 |
11 | 3396571959871 |
12 | 121aa24163763 |
13 | 5b405811c088 |
14 | 2852588439c7 |
15 | 1339b2e35903 |
hex | 99161d38a7b |
10520016161403 has 32 divisors (see below), whose sum is σ = 16469420728320. Its totient is φ = 5846954613120.
The previous prime is 10520016161393. The next prime is 10520016161429. The reversal of 10520016161403 is 30416161002501.
It is a happy number.
10520016161403 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10520016161403 - 24 = 10520016161387 is a prime.
It is a super-2 number, since 2×105200161614032 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10520016161903) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 66843 + ... + 4587428.
It is an arithmetic number, because the mean of its divisors is an integer number (514669397760).
Almost surely, 210520016161403 is an apocalyptic number.
10520016161403 is a deficient number, since it is larger than the sum of its proper divisors (5949404566917).
10520016161403 is a wasteful number, since it uses less digits than its factorization.
10520016161403 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4657227.
The product of its (nonzero) digits is 4320, while the sum is 30.
Adding to 10520016161403 its reverse (30416161002501), we get a palindrome (40936177163904).
The spelling of 10520016161403 in words is "ten trillion, five hundred twenty billion, sixteen million, one hundred sixty-one thousand, four hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •