Base | Representation |
---|---|
bin | 1110100111000100101… |
… | …00000010111010111010 |
3 | 1202222210011020101202000 |
4 | 13103202110002322322 |
5 | 31211110324040434 |
6 | 1022342135121430 |
7 | 51161232021462 |
oct | 7234224027272 |
9 | 1688704211660 |
10 | 502013111994 |
11 | 1839a2350319 |
12 | 81363213276 |
13 | 384552362c4 |
14 | 1a424732ba2 |
15 | d0d2735b99 |
hex | 74e2502eba |
502013111994 has 32 divisors (see below), whose sum is σ = 1115608296000. Its totient is φ = 167334163632.
The previous prime is 502013111993. The next prime is 502013112019. The reversal of 502013111994 is 499111310205.
502013111994 is a `hidden beast` number, since 50 + 201 + 311 + 1 + 9 + 94 = 666.
It is a super-2 number, since 2×5020131119942 (a number of 24 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (502013111993) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4206012 + ... + 4323720.
It is an arithmetic number, because the mean of its divisors is an integer number (34862759250).
Almost surely, 2502013111994 is an apocalyptic number.
502013111994 is a gapful number since it is divisible by the number (54) formed by its first and last digit.
502013111994 is an abundant number, since it is smaller than the sum of its proper divisors (613595184006).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
502013111994 is a wasteful number, since it uses less digits than its factorization.
502013111994 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 196699 (or 196693 counting only the distinct ones).
The product of its (nonzero) digits is 9720, while the sum is 36.
The spelling of 502013111994 in words is "five hundred two billion, thirteen million, one hundred eleven thousand, nine hundred ninety-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •