Base | Representation |
---|---|
bin | 1000111101001101011110010… |
… | …1011111001110110011101001 |
3 | 10001122112110122212012222012222 |
4 | 2033103113211133032303221 |
5 | 1130102020332403330123 |
6 | 10112233335330043425 |
7 | 246516115216646012 |
oct | 21723274537166351 |
9 | 3048473585188188 |
10 | 630251646151913 |
11 | 1728aa249698575 |
12 | 5a82aba9119575 |
13 | 2108962407c536 |
14 | b18c4b18d6009 |
15 | 4cce4595796c8 |
hex | 23d35e57cece9 |
630251646151913 has 2 divisors, whose sum is σ = 630251646151914. Its totient is φ = 630251646151912.
The previous prime is 630251646151903. The next prime is 630251646151931. The reversal of 630251646151913 is 319151646152036.
Together with next prime (630251646151931) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 485937362856169 + 144314283295744 = 22043987^2 + 12013088^2 .
It is a cyclic number.
It is not a de Polignac number, because 630251646151913 - 28 = 630251646151657 is a prime.
It is not a weakly prime, because it can be changed into another prime (630251646151903) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 315125823075956 + 315125823075957.
It is an arithmetic number, because the mean of its divisors is an integer number (315125823075957).
Almost surely, 2630251646151913 is an apocalyptic number.
It is an amenable number.
630251646151913 is a deficient number, since it is larger than the sum of its proper divisors (1).
630251646151913 is an equidigital number, since it uses as much as digits as its factorization.
630251646151913 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3499200, while the sum is 53.
The spelling of 630251646151913 in words is "six hundred thirty trillion, two hundred fifty-one billion, six hundred forty-six million, one hundred fifty-one thousand, nine hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •