Base | Representation |
---|---|
bin | 1011111011010… |
… | …11100001110000 |
3 | 20222021022212101 |
4 | 11331223201300 |
5 | 201103231102 |
6 | 13532310144 |
7 | 2323311661 |
oct | 575534160 |
9 | 228238771 |
10 | 100055152 |
11 | 51529a0a |
12 | 29612354 |
13 | 17962942 |
14 | d407368 |
15 | 8bb5e87 |
hex | 5f6b870 |
100055152 has 40 divisors (see below), whose sum is σ = 207022464. Its totient is φ = 46732224.
The previous prime is 100055147. The next prime is 100055173. The reversal of 100055152 is 251550001.
It is a super-2 number, since 2×1000551522 = 20022066883486208, which contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 12663 + ... + 18985.
Almost surely, 2100055152 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 100055152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (103511232).
100055152 is an abundant number, since it is smaller than the sum of its proper divisors (106967312).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100055152 is a wasteful number, since it uses less digits than its factorization.
100055152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6397 (or 6391 counting only the distinct ones).
The product of its (nonzero) digits is 250, while the sum is 19.
The square root of 100055152 is about 10002.7572198869. The cubic root of 100055152 is about 464.2441986480.
The spelling of 100055152 in words is "one hundred million, fifty-five thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •