Base | Representation |
---|---|
bin | 111110000100101011… |
… | …1010110010110111001 |
3 | 110202001222112121021012 |
4 | 1330021113112112321 |
5 | 4141000040231014 |
6 | 141123201123305 |
7 | 12426216446315 |
oct | 1741127262671 |
9 | 422058477235 |
10 | 133301102009 |
11 | 51594aa6a09 |
12 | 21a02329535 |
13 | c754a8162a |
14 | 6647a90b45 |
15 | 3702a82c3e |
hex | 1f095d65b9 |
133301102009 has 2 divisors, whose sum is σ = 133301102010. Its totient is φ = 133301102008.
The previous prime is 133301101979. The next prime is 133301102017. The reversal of 133301102009 is 900201103331.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 118747092409 + 14554009600 = 344597^2 + 120640^2 .
It is a cyclic number.
It is not a de Polignac number, because 133301102009 - 28 = 133301101753 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (133301102059) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66650551004 + 66650551005.
It is an arithmetic number, because the mean of its divisors is an integer number (66650551005).
Almost surely, 2133301102009 is an apocalyptic number.
It is an amenable number.
133301102009 is a deficient number, since it is larger than the sum of its proper divisors (1).
133301102009 is an equidigital number, since it uses as much as digits as its factorization.
133301102009 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 486, while the sum is 23.
The spelling of 133301102009 in words is "one hundred thirty-three billion, three hundred one million, one hundred two thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •