Base | Representation |
---|---|
bin | 1110100111010011110… |
… | …00111000111110000000 |
3 | 1210000010000101200220021 |
4 | 13103221320320332000 |
5 | 31211340343223242 |
6 | 1022402515223224 |
7 | 51164334240643 |
oct | 7235170707600 |
9 | 1700100350807 |
10 | 502140211072 |
11 | 183a58070785 |
12 | 813998a7b14 |
13 | 38475677566 |
14 | 1a437579a5a |
15 | d0dd98eb67 |
hex | 74e9e38f80 |
502140211072 has 128 divisors (see below), whose sum is σ = 1045113012000. Its totient is φ = 240088375296.
The previous prime is 502140211031. The next prime is 502140211087. The reversal of 502140211072 is 270112041205.
It is a tau number, because it is divible by the number of its divisors (128).
It is a super-2 number, since 2×5021402110722 (a number of 24 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 161510254 + ... + 161513362.
Almost surely, 2502140211072 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 502140211072, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (522556506000).
502140211072 is an abundant number, since it is smaller than the sum of its proper divisors (542972800928).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
502140211072 is a wasteful number, since it uses less digits than its factorization.
502140211072 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3736 (or 3724 counting only the distinct ones).
The product of its (nonzero) digits is 1120, while the sum is 25.
Adding to 502140211072 its reverse (270112041205), we get a palindrome (772252252277).
The spelling of 502140211072 in words is "five hundred two billion, one hundred forty million, two hundred eleven thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •