Base | Representation |
---|---|
bin | 111110000010010011… |
… | …0111011101110000011 |
3 | 110201212102101022000211 |
4 | 1330010212323232003 |
5 | 4140314123113443 |
6 | 141111230454551 |
7 | 12424230242551 |
oct | 1740446735603 |
9 | 421772338024 |
10 | 133221301123 |
11 | 51553a51369 |
12 | 2199b664457 |
13 | c741390a81 |
14 | 663b23abd1 |
15 | 36eaa6d19d |
hex | 1f049bbb83 |
133221301123 has 4 divisors (see below), whose sum is σ = 134466360120. Its totient is φ = 131976242128.
The previous prime is 133221301097. The next prime is 133221301139. The reversal of 133221301123 is 321103122331.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 133221301123 - 225 = 133187746691 is a prime.
It is a super-2 number, since 2×1332213011232 (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 = 133221301094 and 133221301103.
It is not an unprimeable number, because it can be changed into a prime (133221301723) 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, 622529338 + ... + 622529551.
It is an arithmetic number, because the mean of its divisors is an integer number (33616590030).
Almost surely, 2133221301123 is an apocalyptic number.
133221301123 is a deficient number, since it is larger than the sum of its proper divisors (1245058997).
133221301123 is a wasteful number, since it uses less digits than its factorization.
133221301123 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1245058996.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 133221301123 its reverse (321103122331), we get a palindrome (454324423454).
The spelling of 133221301123 in words is "one hundred thirty-three billion, two hundred twenty-one million, three hundred one thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •