Base | Representation |
---|---|
bin | 11001000001000001000011… |
… | …111000110100000010001000 |
3 | 112102112220111010200110012211 |
4 | 121001001003320310002020 |
5 | 103410041022413033000 |
6 | 1025554543121314504 |
7 | 32113520320120261 |
oct | 3101010370640210 |
9 | 472486433613184 |
10 | 110021021221000 |
11 | 3206872026770a |
12 | 1040a989495a34 |
13 | 4950c26406376 |
14 | 1d2508dad9968 |
15 | cabd74e527ba |
hex | 641043e34088 |
110021021221000 has 64 divisors (see below), whose sum is σ = 260975891058480. Its totient is φ = 43405553548800.
The previous prime is 110021021220953. The next prime is 110021021221051. The reversal of 110021021221000 is 122120120011.
It can be written as a sum of positive squares in 8 ways, for example, as 20582427209796 + 89438594011204 = 4536786^2 + 9457198^2 .
It is a super-2 number, since 2×1100210212210002 (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 15 ways as a sum of consecutive naturals, for example, 753495639 + ... + 753641638.
Almost surely, 2110021021221000 is an apocalyptic number.
110021021221000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
110021021221000 is an abundant number, since it is smaller than the sum of its proper divisors (150954869837480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110021021221000 is a wasteful number, since it uses less digits than its factorization.
110021021221000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1507137371 (or 1507137357 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 110021021221000 its reverse (122120120011), we get a palindrome (110143141341011).
The spelling of 110021021221000 in words is "one hundred ten trillion, twenty-one billion, twenty-one million, two hundred twenty-one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.060 sec. • engine limits •