Base | Representation |
---|---|
bin | 1010001100101000000010… |
… | …0110001000001000101000 |
3 | 1110200212012002200101110120 |
4 | 2203022000212020020220 |
5 | 2432144210130333000 |
6 | 35502422025243240 |
7 | 2235020234365641 |
oct | 243120046101050 |
9 | 43625162611416 |
10 | 11212022121000 |
11 | 3632aa02105a8 |
12 | 1310b6b633520 |
13 | 63439b35169c |
14 | 2aa9441926c8 |
15 | 1469b52bd6a0 |
hex | a3280988228 |
11212022121000 has 128 divisors (see below), whose sum is σ = 37039245010560. Its totient is φ = 2813997696000.
The previous prime is 11212022120993. The next prime is 11212022121029. The reversal of 11212022121000 is 12122021211.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 109870786 + ... + 109972785.
It is an arithmetic number, because the mean of its divisors is an integer number (289369101645).
Almost surely, 211212022121000 is an apocalyptic number.
11212022121000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11212022121000 is an abundant number, since it is smaller than the sum of its proper divisors (25827222889560).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11212022121000 is a wasteful number, since it uses less digits than its factorization.
11212022121000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 219843612 (or 219843598 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 11212022121000 its reverse (12122021211), we get a palindrome (11224144142211).
The spelling of 11212022121000 in words is "eleven trillion, two hundred twelve billion, twenty-two million, one hundred twenty-one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •