Base | Representation |
---|---|
bin | 11001011000110111… |
… | …00011000001111001 |
3 | 1022011220212000222212 |
4 | 30230123203001321 |
5 | 210403330231021 |
6 | 10132305024505 |
7 | 661525546331 |
oct | 145433430171 |
9 | 38156760885 |
10 | 13630320761 |
11 | 5864a62802 |
12 | 2784925135 |
13 | 1392b55575 |
14 | 9343660c1 |
15 | 54b95d85b |
hex | 32c6e3079 |
13630320761 has 2 divisors, whose sum is σ = 13630320762. Its totient is φ = 13630320760.
The previous prime is 13630320751. The next prime is 13630320793. The reversal of 13630320761 is 16702303631.
13630320761 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an a-pointer prime, because the next prime (13630320793) can be obtained adding 13630320761 to its sum of digits (32).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10310371600 + 3319949161 = 101540^2 + 57619^2 .
It is a cyclic number.
It is not a de Polignac number, because 13630320761 - 210 = 13630319737 is a prime.
It is not a weakly prime, because it can be changed into another prime (13630320721) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6815160380 + 6815160381.
It is an arithmetic number, because the mean of its divisors is an integer number (6815160381).
Almost surely, 213630320761 is an apocalyptic number.
It is an amenable number.
13630320761 is a deficient number, since it is larger than the sum of its proper divisors (1).
13630320761 is an equidigital number, since it uses as much as digits as its factorization.
13630320761 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 13608, while the sum is 32.
The spelling of 13630320761 in words is "thirteen billion, six hundred thirty million, three hundred twenty thousand, seven hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •