Base | Representation |
---|---|
bin | 111011001011001001110000… |
… | …1000010111010110001000010 |
3 | 2112020221112100021222222111020 |
4 | 1312112103201002322301002 |
5 | 1021210402123202244432 |
6 | 5043003235354330310 |
7 | 214431022350235542 |
oct | 16626234102726102 |
9 | 2466845307888436 |
10 | 520502272306242 |
11 | 140936857283646 |
12 | 4a4649b1a29996 |
13 | 194581cc7c22a5 |
14 | 92766315db322 |
15 | 40296d2b1822c |
hex | 1d964e10bac42 |
520502272306242 has 8 divisors (see below), whose sum is σ = 1041004544612496. Its totient is φ = 173500757435412.
The previous prime is 520502272306229. The next prime is 520502272306267. The reversal of 520502272306242 is 242603272205025.
It is a sphenic number, since it is the product of 3 distinct primes.
520502272306242 is an admirable number.
It is a super-2 number, since 2×5205022723062422 (a number of 30 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 520502272306194 and 520502272306203.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 43375189358848 + ... + 43375189358859.
It is an arithmetic number, because the mean of its divisors is an integer number (130125568076562).
Almost surely, 2520502272306242 is an apocalyptic number.
520502272306242 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
520502272306242 is a wasteful number, since it uses less digits than its factorization.
520502272306242 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 86750378717712.
The product of its (nonzero) digits is 806400, while the sum is 42.
The spelling of 520502272306242 in words is "five hundred twenty trillion, five hundred two billion, two hundred seventy-two million, three hundred six thousand, two hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •