Base | Representation |
---|---|
bin | 1100001001010111010111… |
… | …1100101001010001110011 |
3 | 1202021201200011010200220212 |
4 | 3002111311330221101303 |
5 | 3222302101212432001 |
6 | 44223114515454335 |
7 | 2545604101210253 |
oct | 302256574512163 |
9 | 52251604120825 |
10 | 13355032155251 |
11 | 4289923539836 |
12 | 15b83652b73ab |
13 | 75b4b2c635a7 |
14 | 34255bd29963 |
15 | 1825dd3947bb |
hex | c2575f29473 |
13355032155251 has 2 divisors, whose sum is σ = 13355032155252. Its totient is φ = 13355032155250.
The previous prime is 13355032155221. The next prime is 13355032155317. The reversal of 13355032155251 is 15255123055331.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13355032155251 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13355032155199 and 13355032155208.
It is not a weakly prime, because it can be changed into another prime (13355032155211) 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, 6677516077625 + 6677516077626.
It is an arithmetic number, because the mean of its divisors is an integer number (6677516077626).
Almost surely, 213355032155251 is an apocalyptic number.
13355032155251 is a deficient number, since it is larger than the sum of its proper divisors (1).
13355032155251 is an equidigital number, since it uses as much as digits as its factorization.
13355032155251 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 337500, while the sum is 41.
The spelling of 13355032155251 in words is "thirteen trillion, three hundred fifty-five billion, thirty-two million, one hundred fifty-five thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •