Base | Representation |
---|---|
bin | 111110010110101100… |
… | …0110010100011000101 |
3 | 110210122002202010202011 |
4 | 1330231120302203011 |
5 | 4143214244200042 |
6 | 141303150414221 |
7 | 12450205424233 |
oct | 1745530624305 |
9 | 423562663664 |
10 | 133905459397 |
11 | 51875160626 |
12 | 21b50801371 |
13 | c820044658 |
14 | 66a404d953 |
15 | 373ab61a17 |
hex | 1f2d6328c5 |
133905459397 has 2 divisors, whose sum is σ = 133905459398. Its totient is φ = 133905459396.
The previous prime is 133905459371. The next prime is 133905459437. The reversal of 133905459397 is 793954509331.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 97440119716 + 36465339681 = 312154^2 + 190959^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-133905459397 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (133905459367) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66952729698 + 66952729699.
It is an arithmetic number, because the mean of its divisors is an integer number (66952729699).
Almost surely, 2133905459397 is an apocalyptic number.
It is an amenable number.
133905459397 is a deficient number, since it is larger than the sum of its proper divisors (1).
133905459397 is an equidigital number, since it uses as much as digits as its factorization.
133905459397 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 13778100, while the sum is 58.
The spelling of 133905459397 in words is "one hundred thirty-three billion, nine hundred five million, four hundred fifty-nine thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •