Base | Representation |
---|---|
bin | 11110010100001101010001… |
… | …010001000111101110101101 |
3 | 122111002020010020222212002120 |
4 | 132110031101101013232231 |
5 | 114433434402000243313 |
6 | 1151322545514343153 |
7 | 40040530342035066 |
oct | 3624152121075655 |
9 | 574066106885076 |
10 | 133330033212333 |
11 | 39534a49929141 |
12 | 12b5430642aab9 |
13 | 5951c78136c39 |
14 | 24cd2cac0956d |
15 | 1063347e85d23 |
hex | 794351447bad |
133330033212333 has 16 divisors (see below), whose sum is σ = 180300979003392. Its totient is φ = 87623217990000.
The previous prime is 133330033212287. The next prime is 133330033212353. The reversal of 133330033212333 is 333212330033331.
It is a happy number.
It is not a de Polignac number, because 133330033212333 - 224 = 133330016435117 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 133330033212294 and 133330033212303.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133330033212353) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 39613693 + ... + 42847458.
It is an arithmetic number, because the mean of its divisors is an integer number (11268811187712).
Almost surely, 2133330033212333 is an apocalyptic number.
It is an amenable number.
133330033212333 is a deficient number, since it is larger than the sum of its proper divisors (46970945791059).
133330033212333 is an equidigital number, since it uses as much as digits as its factorization.
133330033212333 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 82468816.
The product of its (nonzero) digits is 78732, while the sum is 33.
Adding to 133330033212333 its reverse (333212330033331), we get a palindrome (466542363245664).
The spelling of 133330033212333 in words is "one hundred thirty-three trillion, three hundred thirty billion, thirty-three million, two hundred twelve thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •