Base | Representation |
---|---|
bin | 10110110000110100110001… |
… | …010011111000111110011000 |
3 | 111010110122010202001012100122 |
4 | 112300310301103320332120 |
5 | 101110214311310001102 |
6 | 552530530254452412 |
7 | 30041604065331323 |
oct | 2660646123707630 |
9 | 433418122035318 |
10 | 100112220000152 |
11 | 299983992a7258 |
12 | b28a503b04108 |
13 | 43b27075579b9 |
14 | 1aa1658b9b7ba |
15 | b892367350a2 |
hex | 5b0d314f8f98 |
100112220000152 has 16 divisors (see below), whose sum is σ = 198752201471160. Its totient is φ = 47111632941184.
The previous prime is 100112220000151. The next prime is 100112220000229. The reversal of 100112220000152 is 251000022211001.
It is a super-2 number, since 2×1001122200001522 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a self number, because there is not a number n which added to its sum of digits gives 100112220000152.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100112220000151) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 368059632218 + ... + 368059632489.
Almost surely, 2100112220000152 is an apocalyptic number.
It is an amenable number.
100112220000152 is a deficient number, since it is larger than the sum of its proper divisors (98639981471008).
100112220000152 is a wasteful number, since it uses less digits than its factorization.
100112220000152 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 736119264730 (or 736119264726 counting only the distinct ones).
The product of its (nonzero) digits is 80, while the sum is 17.
Adding to 100112220000152 its reverse (251000022211001), we get a palindrome (351112242211153).
The spelling of 100112220000152 in words is "one hundred trillion, one hundred twelve billion, two hundred twenty million, one hundred fifty-two", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •