Base | Representation |
---|---|
bin | 11110010100001110010000… |
… | …110110000101101011010001 |
3 | 122111002022212121002120101201 |
4 | 132110032100312011223101 |
5 | 114433444043031232412 |
6 | 1151323243420431201 |
7 | 40040565643333003 |
oct | 3624162066055321 |
9 | 574068777076351 |
10 | 133331099867857 |
11 | 39535446a39231 |
12 | 12b545636a8501 |
13 | 59520b8111558 |
14 | 24cd38c748373 |
15 | 10633ab931e57 |
hex | 794390d85ad1 |
133331099867857 has 2 divisors, whose sum is σ = 133331099867858. Its totient is φ = 133331099867856.
The previous prime is 133331099867839. The next prime is 133331099867869. The reversal of 133331099867857 is 758768990133331.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 132856421584896 + 474678282961 = 11526336^2 + 688969^2 .
It is a cyclic number.
It is not a de Polignac number, because 133331099867857 - 223 = 133331091479249 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 133331099867857.
It is not a weakly prime, because it can be changed into another prime (133331099867657) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66665549933928 + 66665549933929.
It is an arithmetic number, because the mean of its divisors is an integer number (66665549933929).
Almost surely, 2133331099867857 is an apocalyptic number.
It is an amenable number.
133331099867857 is a deficient number, since it is larger than the sum of its proper divisors (1).
133331099867857 is an equidigital number, since it uses as much as digits as its factorization.
133331099867857 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 617258880, while the sum is 73.
The spelling of 133331099867857 in words is "one hundred thirty-three trillion, three hundred thirty-one billion, ninety-nine million, eight hundred sixty-seven thousand, eight hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.120 sec. • engine limits •