Base | Representation |
---|---|
bin | 1011111010011101111111… |
… | …0110100101000000000001 |
3 | 1201101021002120011112002001 |
4 | 2332213133312211000001 |
5 | 3204103434343141001 |
6 | 43505352023224001 |
7 | 2521244115426532 |
oct | 276473766450001 |
9 | 51337076145061 |
10 | 13099110912001 |
11 | 41a0335686924 |
12 | 15768418a8001 |
13 | 74031922218a |
14 | 334000d6a689 |
15 | 17ab107ed001 |
hex | be9dfda5001 |
13099110912001 has 2 divisors, whose sum is σ = 13099110912002. Its totient is φ = 13099110912000.
The previous prime is 13099110911911. The next prime is 13099110912037. The reversal of 13099110912001 is 10021901199031.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9705966393600 + 3393144518401 = 3115440^2 + 1842049^2 .
It is a cyclic number.
It is not a de Polignac number, because 13099110912001 - 227 = 13098976694273 is a prime.
It is not a weakly prime, because it can be changed into another prime (13099110915001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6549555456000 + 6549555456001.
It is an arithmetic number, because the mean of its divisors is an integer number (6549555456001).
Almost surely, 213099110912001 is an apocalyptic number.
It is an amenable number.
13099110912001 is a deficient number, since it is larger than the sum of its proper divisors (1).
13099110912001 is an equidigital number, since it uses as much as digits as its factorization.
13099110912001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4374, while the sum is 37.
The spelling of 13099110912001 in words is "thirteen trillion, ninety-nine billion, one hundred ten million, nine hundred twelve thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •