Base | Representation |
---|---|
bin | 100100110001100011001… |
… | …1010101000101000011011 |
3 | 122220011210121120100011111 |
4 | 1021203012122220220123 |
5 | 1130302010331123120 |
6 | 14425512221441151 |
7 | 1031104021436542 |
oct | 111430632505033 |
9 | 18804717510144 |
10 | 5054210411035 |
11 | 167952a017755 |
12 | 697658a101b7 |
13 | 2a87c1216666 |
14 | 1368a735d159 |
15 | 8b711a5075a |
hex | 498c66a8a1b |
5054210411035 has 16 divisors (see below), whose sum is σ = 6385949408160. Its totient is φ = 3829549294080.
The previous prime is 5054210411011. The next prime is 5054210411093. The reversal of 5054210411035 is 5301140124505.
It is not a de Polignac number, because 5054210411035 - 29 = 5054210410523 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5054210410988 and 5054210411006.
It is an unprimeable number.
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, 6652876 + ... + 7373545.
It is an arithmetic number, because the mean of its divisors is an integer number (399121838010).
Almost surely, 25054210411035 is an apocalyptic number.
5054210411035 is a deficient number, since it is larger than the sum of its proper divisors (1331738997125).
5054210411035 is a wasteful number, since it uses less digits than its factorization.
5054210411035 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14030238.
The product of its (nonzero) digits is 12000, while the sum is 31.
The spelling of 5054210411035 in words is "five trillion, fifty-four billion, two hundred ten million, four hundred eleven thousand, thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •