Base | Representation |
---|---|
bin | 1111011100010011… |
… | …0110000111000011 |
3 | 101200220000010210100 |
4 | 3313010312013003 |
5 | 31442140230223 |
6 | 1523154533443 |
7 | 204502660200 |
oct | 36704660703 |
9 | 11626003710 |
10 | 4145242563 |
11 | 1837977100 |
12 | 978297283 |
13 | 510a46067 |
14 | 2b4760ca7 |
15 | 193db5043 |
hex | f71361c3 |
4145242563 has 108 divisors (see below), whose sum is σ = 7727343624. Its totient is φ = 2133331200.
The previous prime is 4145242561. The next prime is 4145242567. The reversal of 4145242563 is 3652425414.
4145242563 is a `hidden beast` number, since 4 + 1 + 4 + 52 + 42 + 563 = 666.
It is not a de Polignac number, because 4145242563 - 21 = 4145242561 is a prime.
It is a super-2 number, since 2×41452425632 = 34366071812213617938, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (4145242561) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 107 ways as a sum of consecutive naturals, for example, 6989995 + ... + 6990587.
It is an arithmetic number, because the mean of its divisors is an integer number (71549478).
Almost surely, 24145242563 is an apocalyptic number.
4145242563 is a deficient number, since it is larger than the sum of its proper divisors (3582101061).
4145242563 is a wasteful number, since it uses less digits than its factorization.
4145242563 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 766 (or 745 counting only the distinct ones).
The product of its digits is 115200, while the sum is 36.
The square root of 4145242563 is about 64383.5581728752. The cubic root of 4145242563 is about 1606.3862678823.
Adding to 4145242563 its reverse (3652425414), we get a palindrome (7797667977).
The spelling of 4145242563 in words is "four billion, one hundred forty-five million, two hundred forty-two thousand, five hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •