Base | Representation |
---|---|
bin | 1010000000111000001111… |
… | …0010000100110101111111 |
3 | 1102222120021121120020002112 |
4 | 2200032003302010311333 |
5 | 2420342403300400413 |
6 | 35230004400444235 |
7 | 2214314214610604 |
oct | 240160362046577 |
9 | 42876247506075 |
10 | 11010212121983 |
11 | 356544a786348 |
12 | 1299a2991967b |
13 | 61b349051199 |
14 | 2a0c7b9546ab |
15 | 141602eb82a8 |
hex | a0383c84d7f |
11010212121983 has 2 divisors, whose sum is σ = 11010212121984. Its totient is φ = 11010212121982.
The previous prime is 11010212121947. The next prime is 11010212122123. The reversal of 11010212121983 is 38912121201011.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 11010212121983 - 26 = 11010212121919 is a prime.
It is a super-2 number, since 2×110102121219832 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11010212121913) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5505106060991 + 5505106060992.
It is an arithmetic number, because the mean of its divisors is an integer number (5505106060992).
Almost surely, 211010212121983 is an apocalyptic number.
11010212121983 is a deficient number, since it is larger than the sum of its proper divisors (1).
11010212121983 is an equidigital number, since it uses as much as digits as its factorization.
11010212121983 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1728, while the sum is 32.
Adding to 11010212121983 its reverse (38912121201011), we get a palindrome (49922333322994).
The spelling of 11010212121983 in words is "eleven trillion, ten billion, two hundred twelve million, one hundred twenty-one thousand, nine hundred eighty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •