Base | Representation |
---|---|
bin | 11000110101101100… |
… | …10000001111100101 |
3 | 1021102100210001020021 |
4 | 30122312100033211 |
5 | 204302321104223 |
6 | 10043130235141 |
7 | 651314310256 |
oct | 143266201745 |
9 | 37370701207 |
10 | 13335331813 |
11 | 57234a1191 |
12 | 2701b85ab1 |
13 | 13469c05ab |
14 | 9070d8b2d |
15 | 530ade65d |
hex | 31ad903e5 |
13335331813 has 2 divisors, whose sum is σ = 13335331814. Its totient is φ = 13335331812.
The previous prime is 13335331771. The next prime is 13335331819. The reversal of 13335331813 is 31813353331.
13335331813 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13160219524 + 175112289 = 114718^2 + 13233^2 .
It is a cyclic number.
It is not a de Polignac number, because 13335331813 - 213 = 13335323621 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13335331819) 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, 6667665906 + 6667665907.
It is an arithmetic number, because the mean of its divisors is an integer number (6667665907).
Almost surely, 213335331813 is an apocalyptic number.
It is an amenable number.
13335331813 is a deficient number, since it is larger than the sum of its proper divisors (1).
13335331813 is an equidigital number, since it uses as much as digits as its factorization.
13335331813 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 29160, while the sum is 34.
It can be divided in two parts, 133353318 and 13, that added together give a palindrome (133353331).
The spelling of 13335331813 in words is "thirteen billion, three hundred thirty-five million, three hundred thirty-one thousand, eight hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •