Base | Representation |
---|---|
bin | 111101111110111111… |
… | …1001100010111000111 |
3 | 110201120200100210200201 |
4 | 1323331333030113013 |
5 | 4140102204021411 |
6 | 141052221551331 |
7 | 12421411126552 |
oct | 1737577142707 |
9 | 421520323621 |
10 | 133110220231 |
11 | 514a728167a |
12 | 2196a415547 |
13 | c72436a731 |
14 | 662a5a3699 |
15 | 36e0e2a3c1 |
hex | 1efdfcc5c7 |
133110220231 has 8 divisors (see below), whose sum is σ = 136242458000. Its totient is φ = 129979648512.
The previous prime is 133110220213. The next prime is 133110220237. The reversal of 133110220231 is 132022011331.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 133110220231 - 29 = 133110219719 is a prime.
It is a super-2 number, since 2×1331102202312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 133110220199 and 133110220208.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133110220237) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 254106 + ... + 575143.
It is an arithmetic number, because the mean of its divisors is an integer number (17030307250).
Almost surely, 2133110220231 is an apocalyptic number.
133110220231 is a deficient number, since it is larger than the sum of its proper divisors (3132237769).
133110220231 is an equidigital number, since it uses as much as digits as its factorization.
133110220231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 833025.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 133110220231 its reverse (132022011331), we get a palindrome (265132231562).
The spelling of 133110220231 in words is "one hundred thirty-three billion, one hundred ten million, two hundred twenty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •