Base | Representation |
---|---|
bin | 10010110000000010… |
… | …001001111001001011 |
3 | 1220222010012202020101 |
4 | 102300002021321023 |
5 | 312213101132021 |
6 | 13125444510231 |
7 | 1311630403045 |
oct | 226002117113 |
9 | 56863182211 |
10 | 20133224011 |
11 | 85a175320a |
12 | 3a9a6ab377 |
13 | 1b8b181a04 |
14 | d8dc84a95 |
15 | 7cc7d4a91 |
hex | 4b0089e4b |
20133224011 has 8 divisors (see below), whose sum is σ = 21194169920. Its totient is φ = 19072408392.
The previous prime is 20133223991. The next prime is 20133224017. The reversal of 20133224011 is 11042233102.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 20133224011 - 213 = 20133215819 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 20133224011.
It is not an unprimeable number, because it can be changed into a prime (20133224017) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 586036 + ... + 619438.
It is an arithmetic number, because the mean of its divisors is an integer number (2649271240).
Almost surely, 220133224011 is an apocalyptic number.
20133224011 is a deficient number, since it is larger than the sum of its proper divisors (1060945909).
20133224011 is a wasteful number, since it uses less digits than its factorization.
20133224011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 65145.
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 20133224011 its reverse (11042233102), we get a palindrome (31175457113).
Subtracting from 20133224011 its reverse (11042233102), we obtain a palindrome (9090990909).
The spelling of 20133224011 in words is "twenty billion, one hundred thirty-three million, two hundred twenty-four thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •