Base | Representation |
---|---|
bin | 111110000010000000… |
… | …0011001111100101011 |
3 | 110201211201101011201011 |
4 | 1330010000121330223 |
5 | 4140304031420243 |
6 | 141110230204351 |
7 | 12424045346224 |
oct | 1740400317453 |
9 | 421751334634 |
10 | 133211201323 |
11 | 51549283222 |
12 | 219981b36b7 |
13 | c73c265965 |
14 | 6639b6c24b |
15 | 36e9c2589d |
hex | 1f04019f2b |
133211201323 has 8 divisors (see below), whose sum is σ = 141099230880. Its totient is φ = 125328958080.
The previous prime is 133211201311. The next prime is 133211201351. The reversal of 133211201323 is 323102112331.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-133211201323 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 133211201294 and 133211201303.
It is not an unprimeable number, because it can be changed into a prime (133211201423) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1399128 + ... + 1491301.
It is an arithmetic number, because the mean of its divisors is an integer number (17637403860).
Almost surely, 2133211201323 is an apocalyptic number.
133211201323 is a deficient number, since it is larger than the sum of its proper divisors (7888029557).
133211201323 is a wasteful number, since it uses less digits than its factorization.
133211201323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2893157.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 133211201323 its reverse (323102112331), we get a palindrome (456313313654).
The spelling of 133211201323 in words is "one hundred thirty-three billion, two hundred eleven million, two hundred one thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •