Base | Representation |
---|---|
bin | 1001000110000101010001… |
… | …1010111101110101000100 |
3 | 1022102000000011210222010200 |
4 | 2101201110122331311010 |
5 | 2302320201124021403 |
6 | 33133552125050500 |
7 | 2051324543244456 |
oct | 221412432756504 |
9 | 38360004728120 |
10 | 10000100220228 |
11 | 3206022965a58 |
12 | 11561053b6a30 |
13 | 57700bb48331 |
14 | 26801657a2d6 |
15 | 1251d3b3cca3 |
hex | 918546bdd44 |
10000100220228 has 72 divisors (see below), whose sum is σ = 25470197538240. Its totient is φ = 3308045538240.
The previous prime is 10000100220221. The next prime is 10000100220239. The reversal of 10000100220228 is 82202200100001.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a self number, because there is not a number n which added to its sum of digits gives 10000100220228.
It is not an unprimeable number, because it can be changed into a prime (10000100220221) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 11991513 + ... + 12798303.
Almost surely, 210000100220228 is an apocalyptic number.
10000100220228 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
10000100220228 is an abundant number, since it is smaller than the sum of its proper divisors (15470097318012).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10000100220228 is a wasteful number, since it uses less digits than its factorization.
10000100220228 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 809417 (or 809412 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 18.
Adding to 10000100220228 its reverse (82202200100001), we get a palindrome (92202300320229).
The spelling of 10000100220228 in words is "ten trillion, one hundred million, two hundred twenty thousand, two hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •