Base | Representation |
---|---|
bin | 11110001111011011000010… |
… | …100111000000110100100101 |
3 | 122102220210101212020120111111 |
4 | 132033123002213000310211 |
5 | 114413043000401413241 |
6 | 1150511530143305021 |
7 | 40005010163251366 |
oct | 3617330247006445 |
9 | 572823355216444 |
10 | 133001222294821 |
11 | 39418557718111 |
12 | 12b006402ab171 |
13 | 5929c663b435a |
14 | 24bb417549b6d |
15 | 1059a0127dc81 |
hex | 78f6c29c0d25 |
133001222294821 has 6 divisors (see below), whose sum is σ = 137745617859122. Its totient is φ = 128414973249360.
The previous prime is 133001222294819. The next prime is 133001222294827. The reversal of 133001222294821 is 128492222100331.
It can be written as a sum of positive squares in 3 ways, for example, as 3433405173025 + 129567817121796 = 1852945^2 + 11382786^2 .
It is not a de Polignac number, because 133001222294821 - 21 = 133001222294819 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133001222294827) 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 in 5 ways as a sum of consecutive naturals, for example, 79073258550 + ... + 79073260231.
Almost surely, 2133001222294821 is an apocalyptic number.
It is an amenable number.
133001222294821 is a deficient number, since it is larger than the sum of its proper divisors (4744395564301).
133001222294821 is an equidigital number, since it uses as much as digits as its factorization.
133001222294821 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 158146518839 (or 158146518810 counting only the distinct ones).
The product of its (nonzero) digits is 82944, while the sum is 40.
The spelling of 133001222294821 in words is "one hundred thirty-three trillion, one billion, two hundred twenty-two million, two hundred ninety-four thousand, eight hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •