Base | Representation |
---|---|
bin | 100100101000001111011… |
… | …1011010000001010100101 |
3 | 122211021012111001122221121 |
4 | 1021100132323100022211 |
5 | 1124440040423120401 |
6 | 14412404453013541 |
7 | 1026465451245253 |
oct | 111203673201245 |
9 | 18737174048847 |
10 | 5034220520101 |
11 | 1671001272833 |
12 | 6937ba3242b1 |
13 | 2a695696b126 |
14 | 13592c5495d3 |
15 | 8ae41b2eca1 |
hex | 4941eed02a5 |
5034220520101 has 8 divisors (see below), whose sum is σ = 5129238928320. Its totient is φ = 4939786841088.
The previous prime is 5034220520083. The next prime is 5034220520177. The reversal of 5034220520101 is 1010250224305.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 5034220520101 - 27 = 5034220519973 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5034220520201) 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 7 ways as a sum of consecutive naturals, for example, 146164921 + ... + 146199358.
It is an arithmetic number, because the mean of its divisors is an integer number (641154866040).
Almost surely, 25034220520101 is an apocalyptic number.
It is an amenable number.
5034220520101 is a deficient number, since it is larger than the sum of its proper divisors (95018408219).
5034220520101 is a wasteful number, since it uses less digits than its factorization.
5034220520101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 292364603.
The product of its (nonzero) digits is 2400, while the sum is 25.
Adding to 5034220520101 its reverse (1010250224305), we get a palindrome (6044470744406).
The spelling of 5034220520101 in words is "five trillion, thirty-four billion, two hundred twenty million, five hundred twenty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •