Base | Representation |
---|---|
bin | 100100100111111101011… |
… | …0111111110001001111111 |
3 | 122211012122022221121111002 |
4 | 1021033322313332021333 |
5 | 1124432321103231002 |
6 | 14412224445120515 |
7 | 1026444455220356 |
oct | 111177267761177 |
9 | 18735568847432 |
10 | 5033615680127 |
11 | 1670820909591 |
12 | 69366b85913b |
13 | 2a688b569558 |
14 | 1358b20a299d |
15 | 8ae089a8002 |
hex | 493fadfe27f |
5033615680127 has 8 divisors (see below), whose sum is σ = 5039141248512. Its totient is φ = 5028090816600.
The previous prime is 5033615680099. The next prime is 5033615680151. The reversal of 5033615680127 is 7210865163305.
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 5033615680127 - 228 = 5033347244671 is a prime.
It is a super-2 number, since 2×50336156801272 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5033615680727) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 14811602 + ... + 15147632.
It is an arithmetic number, because the mean of its divisors is an integer number (629892656064).
Almost surely, 25033615680127 is an apocalyptic number.
5033615680127 is a deficient number, since it is larger than the sum of its proper divisors (5525568385).
5033615680127 is a wasteful number, since it uses less digits than its factorization.
5033615680127 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 352429.
The product of its (nonzero) digits is 907200, while the sum is 47.
The spelling of 5033615680127 in words is "five trillion, thirty-three billion, six hundred fifteen million, six hundred eighty thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •