Base | Representation |
---|---|
bin | 10110111111010110000010… |
… | …111001011110011010100000 |
3 | 111021000000122020002000111202 |
4 | 112333112002321132122200 |
5 | 101223041310413020000 |
6 | 555013145201500332 |
7 | 30203646403631522 |
oct | 2677260271363240 |
9 | 437000566060452 |
10 | 101110021220000 |
11 | 2a242579056071 |
12 | b40b9716416a8 |
13 | 445583212b1a0 |
14 | 1ad7a731a3a12 |
15 | ba5184e20dd5 |
hex | 5bf582e5e6a0 |
101110021220000 has 120 divisors (see below), whose sum is σ = 267880113139716. Its totient is φ = 37332930816000.
The previous prime is 101110021219993. The next prime is 101110021220057. The reversal of 101110021220000 is 22120011101.
It can be written as a sum of positive squares in 10 ways, for example, as 11056981641616 + 90053039578384 = 3325204^2 + 9489628^2 .
It is a super-2 number, since 2×1011100212200002 (a number of 29 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 194182349 + ... + 194702348.
Almost surely, 2101110021220000 is an apocalyptic number.
101110021220000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101110021220000 is an abundant number, since it is smaller than the sum of its proper divisors (166770091919716).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101110021220000 is an equidigital number, since it uses as much as digits as its factorization.
101110021220000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 388884740 (or 388884717 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 101110021220000 its reverse (22120011101), we get a palindrome (101132141231101).
The spelling of 101110021220000 in words is "one hundred one trillion, one hundred ten billion, twenty-one million, two hundred twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •