Base | Representation |
---|---|
bin | 1011110110101000100100… |
… | …1110101101010001010011 |
3 | 1201010222001102110102221002 |
4 | 2331222021032231101103 |
5 | 3202014030134010344 |
6 | 43415215025252215 |
7 | 2513422444361246 |
oct | 275521116552123 |
9 | 51128042412832 |
10 | 13033233110099 |
11 | 41753aa351244 |
12 | 1565b1749406b |
13 | 73704ab127c7 |
14 | 330b519d725d |
15 | 17905704e44e |
hex | bda893ad453 |
13033233110099 has 2 divisors, whose sum is σ = 13033233110100. Its totient is φ = 13033233110098.
The previous prime is 13033233110069. The next prime is 13033233110101. The reversal of 13033233110099 is 99001133233031.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13033233110099 is a prime.
It is a Sophie Germain prime.
Together with 13033233110101, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (13033233110069) 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, 6516616555049 + 6516616555050.
It is an arithmetic number, because the mean of its divisors is an integer number (6516616555050).
Almost surely, 213033233110099 is an apocalyptic number.
13033233110099 is a deficient number, since it is larger than the sum of its proper divisors (1).
13033233110099 is an equidigital number, since it uses as much as digits as its factorization.
13033233110099 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 39366, while the sum is 38.
The spelling of 13033233110099 in words is "thirteen trillion, thirty-three billion, two hundred thirty-three million, one hundred ten thousand, ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •