Base | Representation |
---|---|
bin | 11000011000100001… |
… | …10001000011010101 |
3 | 1020210022022120210212 |
4 | 30030100301003111 |
5 | 203302144424301 |
6 | 10002545255205 |
7 | 642253315451 |
oct | 141420610325 |
9 | 36708276725 |
10 | 13090623701 |
11 | 5608352381 |
12 | 2654034505 |
13 | 13080b17ac |
14 | 8c27d9661 |
15 | 5193a34bb |
hex | 30c4310d5 |
13090623701 has 2 divisors, whose sum is σ = 13090623702. Its totient is φ = 13090623700.
The previous prime is 13090623691. The next prime is 13090623709. The reversal of 13090623701 is 10732609031.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10296972676 + 2793651025 = 101474^2 + 52855^2 .
It is a cyclic number.
It is not a de Polignac number, because 13090623701 - 214 = 13090607317 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13090623709) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6545311850 + 6545311851.
It is an arithmetic number, because the mean of its divisors is an integer number (6545311851).
Almost surely, 213090623701 is an apocalyptic number.
It is an amenable number.
13090623701 is a deficient number, since it is larger than the sum of its proper divisors (1).
13090623701 is an equidigital number, since it uses as much as digits as its factorization.
13090623701 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6804, while the sum is 32.
The spelling of 13090623701 in words is "thirteen billion, ninety million, six hundred twenty-three thousand, seven hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •