Base | Representation |
---|---|
bin | 11001011000110110… |
… | …11111001010110111 |
3 | 1022011220211020022022 |
4 | 30230123133022313 |
5 | 210403324224301 |
6 | 10132304423355 |
7 | 661525452254 |
oct | 145433371267 |
9 | 38156736268 |
10 | 13630304951 |
11 | 5864a5193a |
12 | 2784917b5b |
13 | 1392b4b303 |
14 | 93436042b |
15 | 54b958d1b |
hex | 32c6df2b7 |
13630304951 has 2 divisors, whose sum is σ = 13630304952. Its totient is φ = 13630304950.
The previous prime is 13630304927. The next prime is 13630304981. The reversal of 13630304951 is 15940303631.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 13630304951 - 26 = 13630304887 is a prime.
It is a super-2 number, since 2×136303049512 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13630304981) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6815152475 + 6815152476.
It is an arithmetic number, because the mean of its divisors is an integer number (6815152476).
Almost surely, 213630304951 is an apocalyptic number.
13630304951 is a deficient number, since it is larger than the sum of its proper divisors (1).
13630304951 is an equidigital number, since it uses as much as digits as its factorization.
13630304951 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 29160, while the sum is 35.
The spelling of 13630304951 in words is "thirteen billion, six hundred thirty million, three hundred four thousand, nine hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •