Base | Representation |
---|---|
bin | 1111100100111101… |
… | …1001001100100001 |
3 | 101210102100100220001 |
4 | 3321033121030201 |
5 | 32030434442040 |
6 | 1530533220001 |
7 | 205423456165 |
oct | 37117311441 |
9 | 11712310801 |
10 | 4181562145 |
11 | 1856423592 |
12 | 988491601 |
13 | 518421637 |
14 | 2b94d6ca5 |
15 | 19718b59a |
hex | f93d9321 |
4181562145 has 4 divisors (see below), whose sum is σ = 5017874580. Its totient is φ = 3345249712.
The previous prime is 4181562107. The next prime is 4181562149. The reversal of 4181562145 is 5412651814.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1741893696 + 2439668449 = 41736^2 + 49393^2 .
It is a cyclic number.
It is not a de Polignac number, because 4181562145 - 229 = 3644691233 is a prime.
It is not an unprimeable number, because it can be changed into a prime (4181562149) 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 3 ways as a sum of consecutive naturals, for example, 418156210 + ... + 418156219.
It is an arithmetic number, because the mean of its divisors is an integer number (1254468645).
Almost surely, 24181562145 is an apocalyptic number.
It is an amenable number.
4181562145 is a deficient number, since it is larger than the sum of its proper divisors (836312435).
4181562145 is an equidigital number, since it uses as much as digits as its factorization.
4181562145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 836312434.
The product of its digits is 38400, while the sum is 37.
The square root of 4181562145 is about 64664.9993814274. Note that the first 3 decimals coincide. The cubic root of 4181562145 is about 1611.0642173703.
The spelling of 4181562145 in words is "four billion, one hundred eighty-one million, five hundred sixty-two thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •