Base | Representation |
---|---|
bin | 111010011001000000010110… |
… | …1101000001000111111110111 |
3 | 2111100112122112101000101020222 |
4 | 1310302000231220020333313 |
5 | 1014304442023430402244 |
6 | 5020205123304444555 |
7 | 213120051635440646 |
oct | 16462005550107767 |
9 | 2440478471011228 |
10 | 513610134622199 |
11 | 13971992022978a |
12 | 49731102a7975b |
13 | 190782c6840374 |
14 | 90b8c126cd35d |
15 | 3e5a2a1a03bee |
hex | 1d3202da08ff7 |
513610134622199 has 8 divisors (see below), whose sum is σ = 514157302212288. Its totient is φ = 513063010932480.
The previous prime is 513610134622187. The next prime is 513610134622253. The reversal of 513610134622199 is 991226431016315.
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 513610134622199 - 24 = 513610134622183 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 513610134622199.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (513610134622129) 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, 12462914 + ... + 34388144.
It is an arithmetic number, because the mean of its divisors is an integer number (64269662776536).
Almost surely, 2513610134622199 is an apocalyptic number.
513610134622199 is a deficient number, since it is larger than the sum of its proper divisors (547167590089).
513610134622199 is a wasteful number, since it uses less digits than its factorization.
513610134622199 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21950185.
The product of its (nonzero) digits is 2099520, while the sum is 53.
The spelling of 513610134622199 in words is "five hundred thirteen trillion, six hundred ten billion, one hundred thirty-four million, six hundred twenty-two thousand, one hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •