Base | Representation |
---|---|
bin | 11110010010011110100000… |
… | …011010111011111100111111 |
3 | 122110122212010202010102121210 |
4 | 132102132200122323330333 |
5 | 114430012314114220221 |
6 | 1151152200244055503 |
7 | 40026120202212063 |
oct | 3622364032737477 |
9 | 573585122112553 |
10 | 133211102101311 |
11 | 3949956936a143 |
12 | 12b35254694593 |
13 | 59439a3529970 |
14 | 24c7647823aa3 |
15 | 10601d6c6d276 |
hex | 7927a06bbf3f |
133211102101311 has 32 divisors (see below), whose sum is σ = 195673337395200. Its totient is φ = 80097947564544.
The previous prime is 133211102101289. The next prime is 133211102101313. The reversal of 133211102101311 is 113101201112331.
It is not a de Polignac number, because 133211102101311 - 25 = 133211102101279 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133211102101313) 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 31 ways as a sum of consecutive naturals, for example, 59564650 + ... + 61760583.
It is an arithmetic number, because the mean of its divisors is an integer number (6114791793600).
Almost surely, 2133211102101311 is an apocalyptic number.
133211102101311 is a deficient number, since it is larger than the sum of its proper divisors (62462235293889).
133211102101311 is a wasteful number, since it uses less digits than its factorization.
133211102101311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 121325895.
The product of its (nonzero) digits is 108, while the sum is 21.
Adding to 133211102101311 its reverse (113101201112331), we get a palindrome (246312303213642).
The spelling of 133211102101311 in words is "one hundred thirty-three trillion, two hundred eleven billion, one hundred two million, one hundred one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •