Base | Representation |
---|---|
bin | 100000000000101… |
… | …1101100101110100 |
3 | 2202212011012201210 |
4 | 1000001131211310 |
5 | 4144434001142 |
6 | 254330121420 |
7 | 35421625161 |
oct | 10001354564 |
9 | 2685135653 |
10 | 1074125172 |
11 | 50135215a |
12 | 25b880270 |
13 | 1416c1533 |
14 | a2925068 |
15 | 6447449c |
hex | 4005d974 |
1074125172 has 24 divisors (see below), whose sum is σ = 2519419392. Its totient is φ = 356166400.
The previous prime is 1074125167. The next prime is 1074125177. The reversal of 1074125172 is 2715214701.
It is an interprime number because it is at equal distance from previous prime (1074125167) and next prime (1074125177).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1074125177) 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, 232029 + ... + 236612.
It is an arithmetic number, because the mean of its divisors is an integer number (104975808).
Almost surely, 21074125172 is an apocalyptic number.
1074125172 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1074125172 is an abundant number, since it is smaller than the sum of its proper divisors (1445294220).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1074125172 is a wasteful number, since it uses less digits than its factorization.
1074125172 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 468839 (or 468837 counting only the distinct ones).
The product of its (nonzero) digits is 3920, while the sum is 30.
The square root of 1074125172 is about 32773.8489042712. The cubic root of 1074125172 is about 1024.1218485476.
Adding to 1074125172 its reverse (2715214701), we get a palindrome (3789339873).
The spelling of 1074125172 in words is "one billion, seventy-four million, one hundred twenty-five thousand, one hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •