Base | Representation |
---|---|
bin | 11000111000000011… |
… | …00100110011111011 |
3 | 1021110201221012100021 |
4 | 30130001210303323 |
5 | 204322344424414 |
6 | 10045113351311 |
7 | 651644165065 |
oct | 143401446373 |
9 | 37421835307 |
10 | 13355076859 |
11 | 5733657a03 |
12 | 2708708537 |
13 | 134ab14957 |
14 | 909998735 |
15 | 5326dec24 |
hex | 31c064cfb |
13355076859 has 2 divisors, whose sum is σ = 13355076860. Its totient is φ = 13355076858.
The previous prime is 13355076829. The next prime is 13355076883. The reversal of 13355076859 is 95867055331.
13355076859 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 is a cyclic number.
It is not a de Polignac number, because 13355076859 - 29 = 13355076347 is a prime.
It is a super-3 number, since 3×133550768593 (a number of 31 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (13355076829) 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, 6677538429 + 6677538430.
It is an arithmetic number, because the mean of its divisors is an integer number (6677538430).
Almost surely, 213355076859 is an apocalyptic number.
13355076859 is a deficient number, since it is larger than the sum of its proper divisors (1).
13355076859 is an equidigital number, since it uses as much as digits as its factorization.
13355076859 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3402000, while the sum is 52.
The spelling of 13355076859 in words is "thirteen billion, three hundred fifty-five million, seventy-six thousand, eight hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •