Base | Representation |
---|---|
bin | 11101101100001101000… |
… | …00000111110001111100 |
3 | 10121112012222012102211020 |
4 | 32312012200013301330 |
5 | 113203243414112242 |
6 | 2100353511024140 |
7 | 133463416236165 |
oct | 16660640076174 |
9 | 3545188172736 |
10 | 1020163816572 |
11 | 36371597380a |
12 | 14586a96b050 |
13 | 7527c89c154 |
14 | 3753a3b276c |
15 | 1b80ba906ec |
hex | ed86807c7c |
1020163816572 has 96 divisors (see below), whose sum is σ = 2465085063168. Its totient is φ = 328026360000.
The previous prime is 1020163816571. The next prime is 1020163816631. The reversal of 1020163816572 is 2756183610201.
It is a happy number.
1020163816572 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1020163816571) 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, 242259547 + ... + 242263757.
It is an arithmetic number, because the mean of its divisors is an integer number (25677969408).
Almost surely, 21020163816572 is an apocalyptic number.
1020163816572 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1020163816572 is an abundant number, since it is smaller than the sum of its proper divisors (1444921246596).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1020163816572 is a wasteful number, since it uses less digits than its factorization.
1020163816572 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6191 (or 6189 counting only the distinct ones).
The product of its (nonzero) digits is 120960, while the sum is 42.
The spelling of 1020163816572 in words is "one trillion, twenty billion, one hundred sixty-three million, eight hundred sixteen thousand, five hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.108 sec. • engine limits •