Base | Representation |
---|---|
bin | 111110000010100110… |
… | …0010110011111010101 |
3 | 110201220002211122102022 |
4 | 1330011030112133111 |
5 | 4140324131010401 |
6 | 141112221022525 |
7 | 12424406515265 |
oct | 1740514263725 |
9 | 421802748368 |
10 | 133231110101 |
11 | 51559540a61 |
12 | 219a29b4a45 |
13 | c7434166bb |
14 | 663c6717a5 |
15 | 36eb85971b |
hex | 1f053167d5 |
133231110101 has 4 divisors (see below), whose sum is σ = 133433282400. Its totient is φ = 133028937804.
The previous prime is 133231110097. The next prime is 133231110109. The reversal of 133231110101 is 101011132331.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 133231110101 - 22 = 133231110097 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 133231110101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133231110109) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 101085161 + ... + 101086478.
It is an arithmetic number, because the mean of its divisors is an integer number (33358320600).
Almost surely, 2133231110101 is an apocalyptic number.
It is an amenable number.
133231110101 is a deficient number, since it is larger than the sum of its proper divisors (202172299).
133231110101 is an equidigital number, since it uses as much as digits as its factorization.
133231110101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 202172298.
The product of its (nonzero) digits is 54, while the sum is 17.
Adding to 133231110101 its reverse (101011132331), we get a palindrome (234242242432).
The spelling of 133231110101 in words is "one hundred thirty-three billion, two hundred thirty-one million, one hundred ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •