Base | Representation |
---|---|
bin | 11110010001010100001101… |
… | …110000111111010100110011 |
3 | 122110101020020110000121102001 |
4 | 132101110031300333110303 |
5 | 114422210432022021321 |
6 | 1151051404550434431 |
7 | 40020264343340053 |
oct | 3621241560772463 |
9 | 573336213017361 |
10 | 133131332220211 |
11 | 39468754347876 |
12 | 12b218b1962a17 |
13 | 59392ccc962a0 |
14 | 24c383b46b563 |
15 | 105d0b8aa7c91 |
hex | 79150dc3f533 |
133131332220211 has 16 divisors (see below), whose sum is σ = 151818095699424. Its totient is φ = 115652289729024.
The previous prime is 133131332220181. The next prime is 133131332220221. The reversal of 133131332220211 is 112022233131331.
It is a cyclic number.
It is not a de Polignac number, because 133131332220211 - 27 = 133131332220083 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 133131332220211.
It is not an unprimeable number, because it can be changed into a prime (133131332220221) 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, 21521781 + ... + 27008326.
It is an arithmetic number, because the mean of its divisors is an integer number (9488630981214).
Almost surely, 2133131332220211 is an apocalyptic number.
133131332220211 is a deficient number, since it is larger than the sum of its proper divisors (18686763479213).
133131332220211 is a wasteful number, since it uses less digits than its factorization.
133131332220211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48542550.
The product of its (nonzero) digits is 3888, while the sum is 28.
Adding to 133131332220211 its reverse (112022233131331), we get a palindrome (245153565351542).
The spelling of 133131332220211 in words is "one hundred thirty-three trillion, one hundred thirty-one billion, three hundred thirty-two million, two hundred twenty thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •