Base | Representation |
---|---|
bin | 111101111111010110… |
… | …0111110100000010101 |
3 | 110201121111221120011102 |
4 | 1323332230332200111 |
5 | 4140113242101401 |
6 | 141053331115445 |
7 | 12421615134461 |
oct | 1737654764025 |
9 | 421544846142 |
10 | 133122222101 |
11 | 51503029880 |
12 | 21972442b85 |
13 | c7269b052b |
14 | 662c0094a1 |
15 | 36e1eeb56b |
hex | 1efeb3e815 |
133122222101 has 12 divisors (see below), whose sum is σ = 147074406720. Its totient is φ = 119478646560.
The previous prime is 133122222073. The next prime is 133122222143. The reversal of 133122222101 is 101222221331.
It is not a de Polignac number, because 133122222101 - 214 = 133122205717 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 (133122222301) 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 11 ways as a sum of consecutive naturals, for example, 10749425 + ... + 10761801.
It is an arithmetic number, because the mean of its divisors is an integer number (12256200560).
Almost surely, 2133122222101 is an apocalyptic number.
133122222101 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
133122222101 is a deficient number, since it is larger than the sum of its proper divisors (13952184619).
133122222101 is an frugal number, since it uses more digits than its factorization.
133122222101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24844 (or 12467 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 133122222101 its reverse (101222221331), we get a palindrome (234344443432).
The spelling of 133122222101 in words is "one hundred thirty-three billion, one hundred twenty-two million, two hundred twenty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •