Base | Representation |
---|---|
bin | 1000011111000001… |
… | …10111111101001101 |
3 | 102202110111100010100 |
4 | 10033200313331031 |
5 | 33312120241331 |
6 | 2032002401313 |
7 | 220611633555 |
oct | 41740677515 |
9 | 12673440110 |
10 | 4555243341 |
11 | 1a28352820 |
12 | a71660239 |
13 | 57797967c |
14 | 312daa165 |
15 | 1b9da1ae6 |
hex | 10f837f4d |
4555243341 has 24 divisors (see below), whose sum is σ = 7212011040. Its totient is φ = 2747656800.
The previous prime is 4555243339. The next prime is 4555243349. The reversal of 4555243341 is 1433425554.
It is not a de Polignac number, because 4555243341 - 21 = 4555243339 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 4555243296 and 4555243305.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4555243349) 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 23 ways as a sum of consecutive naturals, for example, 88146 + ... + 129923.
It is an arithmetic number, because the mean of its divisors is an integer number (300500460).
Almost surely, 24555243341 is an apocalyptic number.
It is an amenable number.
4555243341 is a deficient number, since it is larger than the sum of its proper divisors (2656767699).
4555243341 is a wasteful number, since it uses less digits than its factorization.
4555243341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 218297 (or 218294 counting only the distinct ones).
The product of its digits is 144000, while the sum is 36.
The square root of 4555243341 is about 67492.5428547480. The cubic root of 4555243341 is about 1657.6920727710.
Adding to 4555243341 its reverse (1433425554), we get a palindrome (5988668895).
The spelling of 4555243341 in words is "four billion, five hundred fifty-five million, two hundred forty-three thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •