Base | Representation |
---|---|
bin | 11110001111011100111001… |
… | …110111001011001100101101 |
3 | 122102220222120021221221221101 |
4 | 132033130321313023030231 |
5 | 114413111100043122313 |
6 | 1150512500454003101 |
7 | 40005110566164361 |
oct | 3617347167131455 |
9 | 572828507857841 |
10 | 133003223020333 |
11 | 3941939400a876 |
12 | 12b00aba346491 |
13 | 592a1c4a539c3 |
14 | 24bb5671532a1 |
15 | 1059abbc365dd |
hex | 78f739dcb32d |
133003223020333 has 16 divisors (see below), whose sum is σ = 143401894797312. Its totient is φ = 122997172518000.
The previous prime is 133003223020273. The next prime is 133003223020351. The reversal of 133003223020333 is 333020322300331.
It is a cyclic number.
It is not a de Polignac number, because 133003223020333 - 225 = 133003189465901 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 (133003223020373) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 89730603 + ... + 91200808.
It is an arithmetic number, because the mean of its divisors is an integer number (8962618424832).
Almost surely, 2133003223020333 is an apocalyptic number.
It is an amenable number.
133003223020333 is a deficient number, since it is larger than the sum of its proper divisors (10398671776979).
133003223020333 is a wasteful number, since it uses less digits than its factorization.
133003223020333 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 180932496.
The product of its (nonzero) digits is 17496, while the sum is 28.
Adding to 133003223020333 its reverse (333020322300331), we get a palindrome (466023545320664).
The spelling of 133003223020333 in words is "one hundred thirty-three trillion, three billion, two hundred twenty-three million, twenty thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •