Base | Representation |
---|---|
bin | 10000111001010001100… |
… | …11000011010101110111 |
3 | 2001111101101200022200122 |
4 | 20130220303003111313 |
5 | 34002333243303011 |
6 | 1122402542002155 |
7 | 56640312365303 |
oct | 10345063032567 |
9 | 2044341608618 |
10 | 580505056631 |
11 | 204210a75055 |
12 | 94609b7635b |
13 | 42983ab8466 |
14 | 2014d0acd03 |
15 | 101786183db |
hex | 8728cc3577 |
580505056631 has 2 divisors, whose sum is σ = 580505056632. Its totient is φ = 580505056630.
The previous prime is 580505056613. The next prime is 580505056633. The reversal of 580505056631 is 136650505085.
580505056631 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
Together with previous prime (580505056613) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 580505056631 - 218 = 580504794487 is a prime.
It is a super-2 number, since 2×5805050566312 (a number of 24 digits) contains 22 as substring.
Together with 580505056633, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (580505056633) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 290252528315 + 290252528316.
It is an arithmetic number, because the mean of its divisors is an integer number (290252528316).
Almost surely, 2580505056631 is an apocalyptic number.
580505056631 is a deficient number, since it is larger than the sum of its proper divisors (1).
580505056631 is an equidigital number, since it uses as much as digits as its factorization.
580505056631 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 540000, while the sum is 44.
The spelling of 580505056631 in words is "five hundred eighty billion, five hundred five million, fifty-six thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •