Base | Representation |
---|---|
bin | 111110000010010001… |
… | …0000000110000010110 |
3 | 110201212022221202100121 |
4 | 1330010202000300112 |
5 | 4140313310323110 |
6 | 141111143102154 |
7 | 12424213260421 |
oct | 1740442006026 |
9 | 421768852317 |
10 | 133220011030 |
11 | 51553250077 |
12 | 2199b14195a |
13 | c74102b7c2 |
14 | 663adc29b8 |
15 | 36ea8b5cda |
hex | 1f04880c16 |
133220011030 has 16 divisors (see below), whose sum is σ = 240276582000. Its totient is φ = 53181212832.
The previous prime is 133220010997. The next prime is 133220011031. The reversal of 133220011030 is 30110022331.
It is a junction number, because it is equal to n+sod(n) for n = 133220010995 and 133220011013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133220011031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 13343709 + ... + 13353688.
It is an arithmetic number, because the mean of its divisors is an integer number (15017286375).
Almost surely, 2133220011030 is an apocalyptic number.
133220011030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
133220011030 is a deficient number, since it is larger than the sum of its proper divisors (107056570970).
133220011030 is a wasteful number, since it uses less digits than its factorization.
133220011030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26697903.
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 133220011030 its reverse (30110022331), we get a palindrome (163330033361).
The spelling of 133220011030 in words is "one hundred thirty-three billion, two hundred twenty million, eleven thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.448 sec. • engine limits •