Base | Representation |
---|---|
bin | 10110110010000111100011… |
… | …101100101110011100101000 |
3 | 111010210010120210101212201202 |
4 | 112302013203230232130220 |
5 | 101113143334210413000 |
6 | 553035431103103332 |
7 | 30051201653506616 |
oct | 2662074354563450 |
9 | 433703523355652 |
10 | 100201112201000 |
11 | 29a22064666458 |
12 | b2a37918a1b48 |
13 | 43bac029c8405 |
14 | 1aa5a8c8ca6b6 |
15 | b8b6da6d9dd5 |
hex | 5b21e3b2e728 |
100201112201000 has 32 divisors (see below), whose sum is σ = 234470602552680. Its totient is φ = 40080444880000.
The previous prime is 100201112200913. The next prime is 100201112201009. The reversal of 100201112201000 is 102211102001.
It can be written as a sum of positive squares in 4 ways, for example, as 14038645125124 + 86162467075876 = 3746818^2 + 9282374^2 .
It is not an unprimeable number, because it can be changed into a prime (100201112201009) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 50100555101 + ... + 50100557100.
Almost surely, 2100201112201000 is an apocalyptic number.
100201112201000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
100201112201000 is an abundant number, since it is smaller than the sum of its proper divisors (134269490351680).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100201112201000 is a wasteful number, since it uses less digits than its factorization.
100201112201000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 100201112222 (or 100201112208 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 100201112201000 its reverse (102211102001), we get a palindrome (100303323303001).
The spelling of 100201112201000 in words is "one hundred trillion, two hundred one billion, one hundred twelve million, two hundred one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •