Base | Representation |
---|---|
bin | 111101111111010100… |
… | …1011101111001101011 |
3 | 110201121110012211012011 |
4 | 1323332221131321223 |
5 | 4140113023131443 |
6 | 141053255300351 |
7 | 12421604253355 |
oct | 1737651357153 |
9 | 421543184164 |
10 | 133121302123 |
11 | 51502560667 |
12 | 2197207a6b7 |
13 | c72674a874 |
14 | 662bc4a0d5 |
15 | 36e1db8b9d |
hex | 1efea5de6b |
133121302123 has 8 divisors (see below), whose sum is σ = 139006155168. Its totient is φ = 127244529984.
The previous prime is 133121302117. The next prime is 133121302129. The reversal of 133121302123 is 321203121331.
It is an interprime number because it is at equal distance from previous prime (133121302117) and next prime (133121302129).
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 133121302123 - 25 = 133121302091 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 133121302094 and 133121302103.
It is not an unprimeable number, because it can be changed into a prime (133121302129) 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, 1986540 + ... + 2052457.
It is an arithmetic number, because the mean of its divisors is an integer number (17375769396).
Almost surely, 2133121302123 is an apocalyptic number.
133121302123 is a deficient number, since it is larger than the sum of its proper divisors (5884853045).
133121302123 is a wasteful number, since it uses less digits than its factorization.
133121302123 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4040453.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 133121302123 its reverse (321203121331), we get a palindrome (454324423454).
The spelling of 133121302123 in words is "one hundred thirty-three billion, one hundred twenty-one million, three hundred two thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •