Base | Representation |
---|---|
bin | 11110010111101001010001… |
… | …010000100010010101000101 |
3 | 122111220210212001100001002121 |
4 | 132113221101100202111011 |
5 | 120001322143100313141 |
6 | 1152023254022205541 |
7 | 40063562225566225 |
oct | 3627512120422505 |
9 | 574823761301077 |
10 | 133566256260421 |
11 | 39616149659516 |
12 | 12b92050b838b1 |
13 | 596b322b80b7a |
14 | 24da8d9a06085 |
15 | 106957152a1d1 |
hex | 797a51422545 |
133566256260421 has 2 divisors, whose sum is σ = 133566256260422. Its totient is φ = 133566256260420.
The previous prime is 133566256260373. The next prime is 133566256260431. The reversal of 133566256260421 is 124062652665331.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 121470398292321 + 12095857968100 = 11021361^2 + 3477910^2 .
It is a cyclic number.
It is not a de Polignac number, because 133566256260421 - 27 = 133566256260293 is a prime.
It is a super-2 number, since 2×1335662562604212 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (133566256260431) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66783128130210 + 66783128130211.
It is an arithmetic number, because the mean of its divisors is an integer number (66783128130211).
Almost surely, 2133566256260421 is an apocalyptic number.
It is an amenable number.
133566256260421 is a deficient number, since it is larger than the sum of its proper divisors (1).
133566256260421 is an equidigital number, since it uses as much as digits as its factorization.
133566256260421 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9331200, while the sum is 52.
The spelling of 133566256260421 in words is "one hundred thirty-three trillion, five hundred sixty-six billion, two hundred fifty-six million, two hundred sixty thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •