Base | Representation |
---|---|
bin | 11101101101001101010… |
… | …11011111001010011101 |
3 | 10121120121121000200011210 |
4 | 32312212223133022131 |
5 | 113210400114314340 |
6 | 2100523233535033 |
7 | 133512663005532 |
oct | 16664653371235 |
9 | 3546547020153 |
10 | 1020703666845 |
11 | 363972679265 |
12 | 14599b714479 |
13 | 75337697895 |
14 | 3758bd7cd89 |
15 | 1b83e17b180 |
hex | eda6adf29d |
1020703666845 has 64 divisors (see below), whose sum is σ = 1650382848000. Its totient is φ = 538661249280.
The previous prime is 1020703666841. The next prime is 1020703666849. The reversal of 1020703666845 is 5486663070201.
It is an interprime number because it is at equal distance from previous prime (1020703666841) and next prime (1020703666849).
It is not a de Polignac number, because 1020703666845 - 22 = 1020703666841 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1020703666794 and 1020703666803.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1020703666841) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 743410579 + ... + 743411951.
It is an arithmetic number, because the mean of its divisors is an integer number (25787232000).
Almost surely, 21020703666845 is an apocalyptic number.
1020703666845 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1020703666845 is a deficient number, since it is larger than the sum of its proper divisors (629679181155).
1020703666845 is a wasteful number, since it uses less digits than its factorization.
1020703666845 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2770.
The product of its (nonzero) digits is 1451520, while the sum is 48.
The spelling of 1020703666845 in words is "one trillion, twenty billion, seven hundred three million, six hundred sixty-six thousand, eight hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •