Base | Representation |
---|---|
bin | 1110100101111101111… |
… | …01100111100001001110 |
3 | 1202221020211020201020100 |
4 | 13102332331213201032 |
5 | 31203402011430110 |
6 | 1022203231231530 |
7 | 51140440634523 |
oct | 7227675474116 |
9 | 1687224221210 |
10 | 501420030030 |
11 | 183718598037 |
12 | 812186785a6 |
13 | 3838c3c052a |
14 | 1a3a9a6b14a |
15 | d09a632bc0 |
hex | 74bef6784e |
501420030030 has 48 divisors (see below), whose sum is σ = 1335489455664. Its totient is φ = 130450738560.
The previous prime is 501420030017. The next prime is 501420030031. The reversal of 501420030030 is 30030024105.
It is a super-2 number, since 2×5014200300302 (a number of 24 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 501420029985 and 501420030012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (501420030031) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 67939404 + ... + 67946783.
It is an arithmetic number, because the mean of its divisors is an integer number (27822696993).
Almost surely, 2501420030030 is an apocalyptic number.
501420030030 is an abundant number, since it is smaller than the sum of its proper divisors (834069425634).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
501420030030 is a wasteful number, since it uses less digits than its factorization.
501420030030 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 135886241 (or 135886238 counting only the distinct ones).
The product of its (nonzero) digits is 360, while the sum is 18.
Adding to 501420030030 its reverse (30030024105), we get a palindrome (531450054135).
The spelling of 501420030030 in words is "five hundred one billion, four hundred twenty million, thirty thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •