Base | Representation |
---|---|
bin | 111010010100101011000001… |
… | …0111110010110010111110001 |
3 | 2111021102201021011200100111211 |
4 | 1310221112002332112113301 |
5 | 1014220212312402201421 |
6 | 5015031345455240121 |
7 | 213026036122230211 |
oct | 16451260276262761 |
9 | 2437381234610454 |
10 | 513014566053361 |
11 | 13950a28a302a99 |
12 | 496557b0219041 |
13 | 190340b1ccc398 |
14 | 9098074bc6241 |
15 | 3e49a45c2c9e1 |
hex | 1d29582f965f1 |
513014566053361 has 8 divisors (see below), whose sum is σ = 520566709554920. Its totient is φ = 505508613032448.
The previous prime is 513014566053329. The next prime is 513014566053373. The reversal of 513014566053361 is 163350665410315.
It can be written as a sum of positive squares in 4 ways, for example, as 225373474853136 + 287641091200225 = 15012444^2 + 16959985^2 .
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 513014566053361 - 25 = 513014566053329 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (513014566053061) 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, 11547597786 + ... + 11547642211.
It is an arithmetic number, because the mean of its divisors is an integer number (65070838694365).
Almost surely, 2513014566053361 is an apocalyptic number.
It is an amenable number.
513014566053361 is a deficient number, since it is larger than the sum of its proper divisors (7552143501559).
513014566053361 is a wasteful number, since it uses less digits than its factorization.
513014566053361 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 23095240323.
The product of its (nonzero) digits is 2916000, while the sum is 49.
The spelling of 513014566053361 in words is "five hundred thirteen trillion, fourteen billion, five hundred sixty-six million, fifty-three thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •