Base | Representation |
---|---|
bin | 111011001001111110011001… |
… | …1010011000100010100011110 |
3 | 2112020101001122011120120100120 |
4 | 1312103330303103010110132 |
5 | 1021200224212014423032 |
6 | 5042401033313535410 |
7 | 214413233156220126 |
oct | 16623746323042436 |
9 | 2466331564516316 |
10 | 520340443514142 |
11 | 140884163130959 |
12 | 4a439569874566 |
13 | 19445b7c6c4384 |
14 | 926c87cc77c86 |
15 | 40253b083662c |
hex | 1d93f334c451e |
520340443514142 has 16 divisors (see below), whose sum is σ = 1040681984923152. Its totient is φ = 173446631522240.
The previous prime is 520340443514119. The next prime is 520340443514167. The reversal of 520340443514142 is 241415344043025.
It is a super-4 number, since 4×5203404435141424 (a number of 60 digits) contains 4444 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 520340443514094 and 520340443514103.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 39519159 + ... + 51014162.
It is an arithmetic number, because the mean of its divisors is an integer number (65042624057697).
Almost surely, 2520340443514142 is an apocalyptic number.
520340443514142 is an abundant number, since it is smaller than the sum of its proper divisors (520341541409010).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
520340443514142 is a wasteful number, since it uses less digits than its factorization.
520340443514142 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 91491243.
The product of its (nonzero) digits is 921600, while the sum is 42.
Adding to 520340443514142 its reverse (241415344043025), we get a palindrome (761755787557167).
The spelling of 520340443514142 in words is "five hundred twenty trillion, three hundred forty billion, four hundred forty-three million, five hundred fourteen thousand, one hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •