Base | Representation |
---|---|
bin | 1110100111000110110… |
… | …01000110001000111000 |
3 | 1202222211102022000210210 |
4 | 13103203121012020320 |
5 | 31211124442304422 |
6 | 1022344023111120 |
7 | 51161541621432 |
oct | 7234331061070 |
9 | 1688742260723 |
10 | 502031213112 |
11 | 183a01593a20 |
12 | 813692a24a0 |
13 | 38458c03320 |
14 | 1a426cc5652 |
15 | d0d410e10c |
hex | 74e3646238 |
502031213112 has 128 divisors (see below), whose sum is σ = 1474814880000. Its totient is φ = 140398064640.
The previous prime is 502031213071. The next prime is 502031213141. The reversal of 502031213112 is 211312130205.
It is a congruent number.
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, 19408764 + ... + 19434612.
It is an arithmetic number, because the mean of its divisors is an integer number (11521991250).
Almost surely, 2502031213112 is an apocalyptic number.
502031213112 is a gapful number since it is divisible by the number (52) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 502031213112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (737407440000).
502031213112 is an abundant number, since it is smaller than the sum of its proper divisors (972783666888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
502031213112 is a wasteful number, since it uses less digits than its factorization.
502031213112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 31541 (or 31537 counting only the distinct ones).
The product of its (nonzero) digits is 360, while the sum is 21.
Adding to 502031213112 its reverse (211312130205), we get a palindrome (713343343317).
The spelling of 502031213112 in words is "five hundred two billion, thirty-one million, two hundred thirteen thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •