Base | Representation |
---|---|
bin | 10010101111001111… |
… | …110000001001000101 |
3 | 1220221012100110211221 |
4 | 102233033300021011 |
5 | 312201210330313 |
6 | 13124253400341 |
7 | 1311410163112 |
oct | 225717601105 |
9 | 56835313757 |
10 | 20120011333 |
11 | 8595249344 |
12 | 3a961990b1 |
13 | 1b88506a66 |
14 | d8c205909 |
15 | 7cb574c8d |
hex | 4af3f0245 |
20120011333 has 8 divisors (see below), whose sum is σ = 20323950840. Its totient is φ = 19916164800.
The previous prime is 20120011253. The next prime is 20120011339. The reversal of 20120011333 is 33311002102.
It can be written as a sum of positive squares in 4 ways, for example, as 2237100804 + 17882910529 = 47298^2 + 133727^2 .
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 20120011333 - 29 = 20120010821 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20120011339) 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, 462891 + ... + 504487.
It is an arithmetic number, because the mean of its divisors is an integer number (2540493855).
Almost surely, 220120011333 is an apocalyptic number.
It is an amenable number.
20120011333 is a deficient number, since it is larger than the sum of its proper divisors (203939507).
20120011333 is a wasteful number, since it uses less digits than its factorization.
20120011333 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46487.
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 20120011333 its reverse (33311002102), we get a palindrome (53431013435).
The spelling of 20120011333 in words is "twenty billion, one hundred twenty million, eleven thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •