Base | Representation |
---|---|
bin | 1010000000111000001111… |
… | …0010000100110110010010 |
3 | 1102222120021121120020010020 |
4 | 2200032003302010312102 |
5 | 2420342403300401002 |
6 | 35230004400444310 |
7 | 2214314214610632 |
oct | 240160362046622 |
9 | 42876247506106 |
10 | 11010212122002 |
11 | 356544a786365 |
12 | 1299a29919696 |
13 | 61b3490511b2 |
14 | 2a0c7b9546c2 |
15 | 141602eb82bc |
hex | a0383c84d92 |
11010212122002 has 8 divisors (see below), whose sum is σ = 22020424244016. Its totient is φ = 3670070707332.
The previous prime is 11010212121983. The next prime is 11010212122123. The reversal of 11010212122002 is 20022121201011.
It is a sphenic number, since it is the product of 3 distinct primes.
11010212122002 is an admirable number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 917517676828 + ... + 917517676839.
It is an arithmetic number, because the mean of its divisors is an integer number (2752553030502).
Almost surely, 211010212122002 is an apocalyptic number.
11010212122002 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11010212122002 is a wasteful number, since it uses less digits than its factorization.
11010212122002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1835035353672.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 11010212122002 its reverse (20022121201011), we get a palindrome (31032333323013).
The spelling of 11010212122002 in words is "eleven trillion, ten billion, two hundred twelve million, one hundred twenty-two thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.104 sec. • engine limits •