Base | Representation |
---|---|
bin | 1011110110011100100010… |
… | …1101001111010001111001 |
3 | 1201010122201022122111012001 |
4 | 2331213020231033101321 |
5 | 3201440421244023113 |
6 | 43413522323221001 |
7 | 2513246424005326 |
oct | 275471055172171 |
9 | 51118638574161 |
10 | 13030003111033 |
11 | 4173aa2079127 |
12 | 1565375817761 |
13 | 73695489c55c |
14 | 330926a3db4d |
15 | 178e186c77dd |
hex | bd9c8b4f479 |
13030003111033 has 2 divisors, whose sum is σ = 13030003111034. Its totient is φ = 13030003111032.
The previous prime is 13030003110959. The next prime is 13030003111051. The reversal of 13030003111033 is 33011130003031.
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., 8092221370489 + 4937781740544 = 2844683^2 + 2222112^2 .
It is a cyclic number.
It is not a de Polignac number, because 13030003111033 - 213 = 13030003102841 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 13030003111033.
It is not a weakly prime, because it can be changed into another prime (13030003111733) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6515001555516 + 6515001555517.
It is an arithmetic number, because the mean of its divisors is an integer number (6515001555517).
Almost surely, 213030003111033 is an apocalyptic number.
It is an amenable number.
13030003111033 is a deficient number, since it is larger than the sum of its proper divisors (1).
13030003111033 is an equidigital number, since it uses as much as digits as its factorization.
13030003111033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 243, while the sum is 19.
Adding to 13030003111033 its reverse (33011130003031), we get a palindrome (46041133114064).
The spelling of 13030003111033 in words is "thirteen trillion, thirty billion, three million, one hundred eleven thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •