Base | Representation |
---|---|
bin | 111011001000010101111000… |
… | …1101100100100111011001010 |
3 | 2112012120121022122011200212220 |
4 | 1312100223301230210323022 |
5 | 1021133040034134340032 |
6 | 5042105554405114510 |
7 | 214361066313040044 |
oct | 16620536154447312 |
9 | 2465517278150786 |
10 | 520116004605642 |
11 | 1407a7a60227015 |
12 | 4a401b716b8a36 |
13 | 1942a9621937c3 |
14 | 9261a6b148a94 |
15 | 401e626ac412c |
hex | 1d90af1b24eca |
520116004605642 has 64 divisors (see below), whose sum is σ = 1069290542057088. Its totient is φ = 168537233952000.
The previous prime is 520116004605623. The next prime is 520116004605721. The reversal of 520116004605642 is 246506400611025.
It is a junction number, because it is equal to n+sod(n) for n = 520116004605594 and 520116004605603.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1968430917 + ... + 1968695127.
It is an arithmetic number, because the mean of its divisors is an integer number (16707664719642).
Almost surely, 2520116004605642 is an apocalyptic number.
520116004605642 is an abundant number, since it is smaller than the sum of its proper divisors (549174537451446).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
520116004605642 is a wasteful number, since it uses less digits than its factorization.
520116004605642 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 272055.
The product of its (nonzero) digits is 345600, while the sum is 42.
The spelling of 520116004605642 in words is "five hundred twenty trillion, one hundred sixteen billion, four million, six hundred five thousand, six hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •