Base | Representation |
---|---|
bin | 1110111100100011011… |
… | …11010111001000001001 |
3 | 1211002112220210222201220 |
4 | 13132101233113020021 |
5 | 31403220313020131 |
6 | 1031530405432253 |
7 | 52050103563261 |
oct | 7362157271011 |
9 | 1732486728656 |
10 | 513546220041 |
11 | 1888804a9078 |
12 | 8364170b689 |
13 | 395727385aa |
14 | 1abda3367a1 |
15 | d559ecce96 |
hex | 7791bd7209 |
513546220041 has 8 divisors (see below), whose sum is σ = 688929081120. Its totient is φ = 340263752832.
The previous prime is 513546220003. The next prime is 513546220049. The reversal of 513546220041 is 140022645315.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 513546220041 - 225 = 513512665609 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 513546219984 and 513546220011.
It is not an unprimeable number, because it can be changed into a prime (513546220049) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 525097896 + ... + 525098873.
It is an arithmetic number, because the mean of its divisors is an integer number (86116135140).
Almost surely, 2513546220041 is an apocalyptic number.
It is an amenable number.
513546220041 is a deficient number, since it is larger than the sum of its proper divisors (175382861079).
513546220041 is a wasteful number, since it uses less digits than its factorization.
513546220041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1050196935.
The product of its (nonzero) digits is 28800, while the sum is 33.
Adding to 513546220041 its reverse (140022645315), we get a palindrome (653568865356).
The spelling of 513546220041 in words is "five hundred thirteen billion, five hundred forty-six million, two hundred twenty thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •