Base | Representation |
---|---|
bin | 111001000001101111010100… |
… | …0011111111110010111000001 |
3 | 2102210002001111001211012100121 |
4 | 1302003132220133332113001 |
5 | 1011221440242204440223 |
6 | 4534503212051420241 |
7 | 210441404555022433 |
oct | 16203365037762701 |
9 | 2383061431735317 |
10 | 501616352421313 |
11 | 135915333915438 |
12 | 483147395b4681 |
13 | 186b82b039626c |
14 | 8bc250a816653 |
15 | 3ced2d48de15d |
hex | 1c837a87fe5c1 |
501616352421313 has 2 divisors, whose sum is σ = 501616352421314. Its totient is φ = 501616352421312.
The previous prime is 501616352421227. The next prime is 501616352421407. The reversal of 501616352421313 is 313124253616105.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 465236298619569 + 36380053801744 = 21569337^2 + 6031588^2 .
It is a cyclic number.
It is not a de Polignac number, because 501616352421313 - 217 = 501616352290241 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 501616352421313.
It is not a weakly prime, because it can be changed into another prime (501616352421913) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 250808176210656 + 250808176210657.
It is an arithmetic number, because the mean of its divisors is an integer number (250808176210657).
Almost surely, 2501616352421313 is an apocalyptic number.
It is an amenable number.
501616352421313 is a deficient number, since it is larger than the sum of its proper divisors (1).
501616352421313 is an equidigital number, since it uses as much as digits as its factorization.
501616352421313 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 388800, while the sum is 43.
The spelling of 501616352421313 in words is "five hundred one trillion, six hundred sixteen billion, three hundred fifty-two million, four hundred twenty-one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •