Base | Representation |
---|---|
bin | 100100101000011011101… |
… | …0010110000011000000101 |
3 | 122211022020222022120220212 |
4 | 1021100313102300120011 |
5 | 1124441410102201113 |
6 | 14412513215205205 |
7 | 1026511544151131 |
oct | 111206722603005 |
9 | 18738228276825 |
10 | 5034629334533 |
11 | 16711a10090a7 |
12 | 6938b3216805 |
13 | 2a69c0577766 |
14 | 13596a9663c1 |
15 | 8ae679850a8 |
hex | 494374b0605 |
5034629334533 has 2 divisors, whose sum is σ = 5034629334534. Its totient is φ = 5034629334532.
The previous prime is 5034629334517. The next prime is 5034629334541. The reversal of 5034629334533 is 3354339264305.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3618581694049 + 1416047640484 = 1902257^2 + 1189978^2 .
It is a cyclic number.
It is not a de Polignac number, because 5034629334533 - 24 = 5034629334517 is a prime.
It is a super-2 number, since 2×50346293345332 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5034629334583) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2517314667266 + 2517314667267.
It is an arithmetic number, because the mean of its divisors is an integer number (2517314667267).
Almost surely, 25034629334533 is an apocalyptic number.
It is an amenable number.
5034629334533 is a deficient number, since it is larger than the sum of its proper divisors (1).
5034629334533 is an equidigital number, since it uses as much as digits as its factorization.
5034629334533 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10497600, while the sum is 50.
The spelling of 5034629334533 in words is "five trillion, thirty-four billion, six hundred twenty-nine million, three hundred thirty-four thousand, five hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •