Base | Representation |
---|---|
bin | 1111010010100001… |
… | …1111011001001111 |
3 | 101121000212202111111 |
4 | 3310220133121033 |
5 | 31401142130210 |
6 | 1515132232451 |
7 | 203464410115 |
oct | 36450373117 |
9 | 11530782444 |
10 | 4104255055 |
11 | 181682162a |
12 | 96660b727 |
13 | 5053c4bb4 |
14 | 2ad131ab5 |
15 | 1904ba88a |
hex | f4a1f64f |
4104255055 has 8 divisors (see below), whose sum is σ = 5008582800. Its totient is φ = 3227752896.
The previous prime is 4104255011. The next prime is 4104255059. The reversal of 4104255055 is 5505524014.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 4104255055 - 217 = 4104123983 is a prime.
It is a super-4 number, since 4×41042550554 (a number of 40 digits) contains 4444 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4104255059) 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 7 ways as a sum of consecutive naturals, for example, 6956070 + ... + 6956659.
It is an arithmetic number, because the mean of its divisors is an integer number (626072850).
Almost surely, 24104255055 is an apocalyptic number.
4104255055 is a deficient number, since it is larger than the sum of its proper divisors (904327745).
4104255055 is a wasteful number, since it uses less digits than its factorization.
4104255055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13912793.
The product of its (nonzero) digits is 20000, while the sum is 31.
The square root of 4104255055 is about 64064.4601553779. The cubic root of 4104255055 is about 1601.0741556603.
Adding to 4104255055 its reverse (5505524014), we get a palindrome (9609779069).
The spelling of 4104255055 in words is "four billion, one hundred four million, two hundred fifty-five thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •