Base | Representation |
---|---|
bin | 11101000111000010011… |
… | …11000000101001101100 |
3 | 10112121201102212120100202 |
4 | 32203201033000221230 |
5 | 112341413033033400 |
6 | 2043253553413032 |
7 | 132156111050000 |
oct | 16434117005154 |
9 | 3477642776322 |
10 | 1000211221100 |
11 | 356207182493 |
12 | 141a2086a178 |
13 | 7341cc81440 |
14 | 365a650a700 |
15 | 1b04008a4d5 |
hex | e8e13c0a6c |
1000211221100 has 360 divisors, whose sum is σ = 2815058241408. Its totient is φ = 306309427200.
The previous prime is 1000211221067. The next prime is 1000211221123. The reversal of 1000211221100 is 11221120001.
It is a super-3 number, since 3×10002112211003 (a number of 37 digits) contains 333 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 119 ways as a sum of consecutive naturals, for example, 96755132 + ... + 96765468.
Almost surely, 21000211221100 is an apocalyptic number.
1000211221100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1000211221100, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1407529120704).
1000211221100 is an abundant number, since it is smaller than the sum of its proper divisors (1814847020308).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1000211221100 is a wasteful number, since it uses less digits than its factorization.
1000211221100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10423 (or 10395 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 1000211221100 its reverse (11221120001), we get a palindrome (1011432341101).
The spelling of 1000211221100 in words is "one trillion, two hundred eleven million, two hundred twenty-one thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •