Base | Representation |
---|---|
bin | 111010011000001101010010… |
… | …0000110100010110011111001 |
3 | 2111100011011102110222111102112 |
4 | 1310300122210012202303321 |
5 | 1014301142412001412131 |
6 | 5020042503534142105 |
7 | 213106116632362523 |
oct | 16460324406426371 |
9 | 2440134373874375 |
10 | 513500453154041 |
11 | 139687356970331 |
12 | 497139b2951935 |
13 | 1906ab6732c352 |
14 | 90b37a9944a13 |
15 | 3e574d287b02b |
hex | 1d306a41a2cf9 |
513500453154041 has 16 divisors (see below), whose sum is σ = 514422419322240. Its totient is φ = 512579476062720.
The previous prime is 513500453154023. The next prime is 513500453154049. The reversal of 513500453154041 is 140451354005315.
It is a cyclic number.
It is not a de Polignac number, because 513500453154041 - 238 = 513225575247097 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 513500453154041.
It is not an unprimeable number, because it can be changed into a prime (513500453154049) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6490846076 + ... + 6490925186.
It is an arithmetic number, because the mean of its divisors is an integer number (32151401207640).
Almost surely, 2513500453154041 is an apocalyptic number.
It is an amenable number.
513500453154041 is a deficient number, since it is larger than the sum of its proper divisors (921966168199).
513500453154041 is a wasteful number, since it uses less digits than its factorization.
513500453154041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 85216.
The product of its (nonzero) digits is 360000, while the sum is 41.
The spelling of 513500453154041 in words is "five hundred thirteen trillion, five hundred billion, four hundred fifty-three million, one hundred fifty-four thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •