Base | Representation |
---|---|
bin | 11101101100001101001… |
… | …01000100011100100000 |
3 | 10121112020001122100001111 |
4 | 32312012211010130200 |
5 | 113203244232114012 |
6 | 2100353554513104 |
7 | 133463433250540 |
oct | 16660645043440 |
9 | 3545201570044 |
10 | 1020165113632 |
11 | 36371667a265 |
12 | 14586b295794 |
13 | 7527cc34642 |
14 | 3753a62d320 |
15 | 1b80bc49ba7 |
hex | ed86944720 |
1020165113632 has 48 divisors (see below), whose sum is σ = 2295926301312. Its totient is φ = 437107944960.
The previous prime is 1020165113599. The next prime is 1020165113647. The reversal of 1020165113632 is 2363115610201.
It is a junction number, because it is equal to n+sod(n) for n = 1020165113594 and 1020165113603.
It is an unprimeable number.
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, 381957 + ... + 1478587.
It is an arithmetic number, because the mean of its divisors is an integer number (47831797944).
Almost surely, 21020165113632 is an apocalyptic number.
It is an amenable number.
1020165113632 is an abundant number, since it is smaller than the sum of its proper divisors (1275761187680).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1020165113632 is a wasteful number, since it uses less digits than its factorization.
1020165113632 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1100801 (or 1100793 counting only the distinct ones).
The product of its (nonzero) digits is 6480, while the sum is 31.
The spelling of 1020165113632 in words is "one trillion, twenty billion, one hundred sixty-five million, one hundred thirteen thousand, six hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •