Base | Representation |
---|---|
bin | 1010000000111000001111… |
… | …0010000100110110010001 |
3 | 1102222120021121120020010012 |
4 | 2200032003302010312101 |
5 | 2420342403300401001 |
6 | 35230004400444305 |
7 | 2214314214610631 |
oct | 240160362046621 |
9 | 42876247506105 |
10 | 11010212122001 |
11 | 356544a786364 |
12 | 1299a29919695 |
13 | 61b3490511b1 |
14 | 2a0c7b9546c1 |
15 | 141602eb82bb |
hex | a0383c84d91 |
11010212122001 has 8 divisors (see below), whose sum is σ = 11244693097344. Its totient is φ = 10775740361040.
The previous prime is 11010212121983. The next prime is 11010212122123. The reversal of 11010212122001 is 10022121201011.
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 11010212122001 - 226 = 11010145013137 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (11010212122601) 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, 138926 + ... + 4694648.
It is an arithmetic number, because the mean of its divisors is an integer number (1405586637168).
Almost surely, 211010212122001 is an apocalyptic number.
It is an amenable number.
11010212122001 is a deficient number, since it is larger than the sum of its proper divisors (234480975343).
11010212122001 is an equidigital number, since it uses as much as digits as its factorization.
11010212122001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4607191.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 11010212122001 its reverse (10022121201011), we get a palindrome (21032333323012).
The spelling of 11010212122001 in words is "eleven trillion, ten billion, two hundred twelve million, one hundred twenty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •