Base | Representation |
---|---|
bin | 1000011111000010… |
… | …01111100111010001 |
3 | 102202110200021001020 |
4 | 10033201033213101 |
5 | 33312131341431 |
6 | 2032004430053 |
7 | 220612516224 |
oct | 41741174721 |
9 | 12673607036 |
10 | 4555340241 |
11 | 1a28409601 |
12 | a716a8329 |
13 | 5779b17ca |
14 | 312dd35bb |
15 | 1b9dc0696 |
hex | 10f84f9d1 |
4555340241 has 8 divisors (see below), whose sum is σ = 6075024864. Its totient is φ = 3036274560.
The previous prime is 4555340183. The next prime is 4555340323. The reversal of 4555340241 is 1420435554.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 4555340241 - 27 = 4555340113 is a prime.
It is a super-2 number, since 2×45553402412 = 41502249422547876162, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (4555342241) 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 7 ways as a sum of consecutive naturals, for example, 137280 + ... + 167201.
It is an arithmetic number, because the mean of its divisors is an integer number (759378108).
Almost surely, 24555340241 is an apocalyptic number.
It is an amenable number.
4555340241 is a deficient number, since it is larger than the sum of its proper divisors (1519684623).
4555340241 is a wasteful number, since it uses less digits than its factorization.
4555340241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 309471.
The product of its (nonzero) digits is 48000, while the sum is 33.
The square root of 4555340241 is about 67493.2607080144. The cubic root of 4555340241 is about 1657.7038269343.
Adding to 4555340241 its reverse (1420435554), we get a palindrome (5975775795).
The spelling of 4555340241 in words is "four billion, five hundred fifty-five million, three hundred forty thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •