Base | Representation |
---|---|
bin | 1010000001011101000100… |
… | …1001110011010101111111 |
3 | 1110000111210201120200002202 |
4 | 2200113101021303111333 |
5 | 2421023131112400413 |
6 | 35234321502542115 |
7 | 2215114232331131 |
oct | 240272111632577 |
9 | 43014721520082 |
10 | 11020100121983 |
11 | 3569664253077 |
12 | 129b92929793b |
13 | 61c263785b64 |
14 | 2a1538c81051 |
15 | 1419d1100e58 |
hex | a05d127357f |
11020100121983 has 8 divisors (see below), whose sum is σ = 11031906517200. Its totient is φ = 11008295480448.
The previous prime is 11020100121973. The next prime is 11020100122013. The reversal of 11020100121983 is 38912100102011.
It is a happy number.
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 11020100121983 - 220 = 11020099073407 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 (11020100121973) 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, 12335288 + ... + 13198466.
It is an arithmetic number, because the mean of its divisors is an integer number (1378988314650).
Almost surely, 211020100121983 is an apocalyptic number.
11020100121983 is a deficient number, since it is larger than the sum of its proper divisors (11806395217).
11020100121983 is a wasteful number, since it uses less digits than its factorization.
11020100121983 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 876841.
The product of its (nonzero) digits is 864, while the sum is 29.
Adding to 11020100121983 its reverse (38912100102011), we get a palindrome (49932200223994).
The spelling of 11020100121983 in words is "eleven trillion, twenty billion, one hundred million, one hundred twenty-one thousand, nine hundred eighty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •