Base | Representation |
---|---|
bin | 1111010100100101… |
… | …0011011110111001 |
3 | 101121122001210011200 |
4 | 3311021103132321 |
5 | 31410342411032 |
6 | 1520040444413 |
7 | 203630464533 |
oct | 36511233671 |
9 | 11548053150 |
10 | 4112857017 |
11 | 1820667395 |
12 | 969479709 |
13 | 507117309 |
14 | 2b0330853 |
15 | 19111947c |
hex | f52537b9 |
4112857017 has 12 divisors (see below), whose sum is σ = 6132432384. Its totient is φ = 2653455960.
The previous prime is 4112857003. The next prime is 4112857037. The reversal of 4112857017 is 7107582114.
It is not a de Polignac number, because 4112857017 - 26 = 4112856953 is a prime.
It is a super-2 number, since 2×41128570172 = 33831185684572276578, which contains 22 as substring.
It is a Smith number, since the sum of its digits (36) coincides with the sum of the digits of its prime factors.
It is not an unprimeable number, because it can be changed into a prime (4112857037) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 7370433 + ... + 7370990.
It is an arithmetic number, because the mean of its divisors is an integer number (511036032).
Almost surely, 24112857017 is an apocalyptic number.
It is an amenable number.
4112857017 is a deficient number, since it is larger than the sum of its proper divisors (2019575367).
4112857017 is a wasteful number, since it uses less digits than its factorization.
4112857017 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14741460 (or 14741457 counting only the distinct ones).
The product of its (nonzero) digits is 15680, while the sum is 36.
The square root of 4112857017 is about 64131.5602258358. The cubic root of 4112857017 is about 1602.1919198968.
The spelling of 4112857017 in words is "four billion, one hundred twelve million, eight hundred fifty-seven thousand, seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •