Base | Representation |
---|---|
bin | 11110010100000101001001… |
… | …010101100011011111101000 |
3 | 122111001101121100011001100002 |
4 | 132110011021111203133220 |
5 | 114433314020404103222 |
6 | 1151314544150402132 |
7 | 40040101231612232 |
oct | 3624051125433750 |
9 | 574041540131302 |
10 | 133321310222312 |
11 | 39531282a39683 |
12 | 12b52691060348 |
13 | 59511b7b95394 |
14 | 24ccb00501252 |
15 | 1062ed7276392 |
hex | 7941495637e8 |
133321310222312 has 32 divisors (see below), whose sum is σ = 251573691741120. Its totient is φ = 66235307867520.
The previous prime is 133321310222311. The next prime is 133321310222323. The reversal of 133321310222312 is 213222013123331.
It is a super-4 number, since 4×1333213102223124 (a number of 58 digits) contains 4444 as substring.
It is not an unprimeable number, because it can be changed into a prime (133321310222311) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 16332413 + ... + 23095244.
It is an arithmetic number, because the mean of its divisors is an integer number (7861677866910).
Almost surely, 2133321310222312 is an apocalyptic number.
It is an amenable number.
133321310222312 is a deficient number, since it is larger than the sum of its proper divisors (118252381518808).
133321310222312 is a wasteful number, since it uses less digits than its factorization.
133321310222312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39430361 (or 39430357 counting only the distinct ones).
The product of its (nonzero) digits is 7776, while the sum is 29.
Adding to 133321310222312 its reverse (213222013123331), we get a palindrome (346543323345643).
The spelling of 133321310222312 in words is "one hundred thirty-three trillion, three hundred twenty-one billion, three hundred ten million, two hundred twenty-two thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •