Base | Representation |
---|---|
bin | 1100010011110… |
… | …11101101010000 |
3 | 21012022111220100 |
4 | 12021323231100 |
5 | 202414022102 |
6 | 14125212400 |
7 | 2362520262 |
oct | 611735520 |
9 | 235274810 |
10 | 103267152 |
11 | 5332315a |
12 | 2a701100 |
13 | 18518931 |
14 | da01b32 |
15 | 90eca1c |
hex | 627bb50 |
103267152 has 30 divisors (see below), whose sum is σ = 289005002. Its totient is φ = 34422336.
The previous prime is 103267133. The next prime is 103267181. The reversal of 103267152 is 251762301.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 58430736 + 44836416 = 7644^2 + 6696^2 .
It is a super-2 number, since 2×1032671522 = 21328209364382208, which contains 22 as substring.
It is a hoax number, since the sum of its digits (27) coincides with the sum of the digits of its distinct prime factors.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 358423 + ... + 358710.
Almost surely, 2103267152 is an apocalyptic number.
103267152 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
103267152 is an abundant number, since it is smaller than the sum of its proper divisors (185737850).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103267152 is a wasteful number, since it uses less digits than its factorization.
103267152 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 717147 (or 717138 counting only the distinct ones).
The product of its (nonzero) digits is 2520, while the sum is 27.
The square root of 103267152 is about 10162.0446761466. The cubic root of 103267152 is about 469.1597360373.
The spelling of 103267152 in words is "one hundred three million, two hundred sixty-seven thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.029 sec. • engine limits •