Base | Representation |
---|---|
bin | 1010000000110111110110… |
… | …1100100110000101011111 |
3 | 1102222120000111110000020001 |
4 | 2200031331230212011133 |
5 | 2420342201131200413 |
6 | 35225550312235131 |
7 | 2214311535021142 |
oct | 240157554460537 |
9 | 42876014400201 |
10 | 11010110021983 |
11 | 35653a8090086 |
12 | 12999bb69baa7 |
13 | 61b330b53897 |
14 | 2a0c6c178059 |
15 | 1415e904b4dd |
hex | a037db2615f |
11010110021983 has 8 divisors (see below), whose sum is σ = 11037450301200. Its totient is φ = 10982782272000.
The previous prime is 11010110021923. The next prime is 11010110021987. The reversal of 11010110021983 is 38912001101011.
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 11010110021983 - 217 = 11010109890911 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 (11010110021987) 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, 1371393 + ... + 4888858.
It is an arithmetic number, because the mean of its divisors is an integer number (1379681287650).
Almost surely, 211010110021983 is an apocalyptic number.
11010110021983 is a deficient number, since it is larger than the sum of its proper divisors (27340279217).
11010110021983 is an equidigital number, since it uses as much as digits as its factorization.
11010110021983 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6264617.
The product of its (nonzero) digits is 432, while the sum is 28.
Adding to 11010110021983 its reverse (38912001101011), we get a palindrome (49922111122994).
The spelling of 11010110021983 in words is "eleven trillion, ten billion, one hundred ten million, twenty-one thousand, nine hundred eighty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •