Base | Representation |
---|---|
bin | 1111110110100110… |
… | …0010101101101101 |
3 | 101222120112002212111 |
4 | 3331221202231231 |
5 | 32203403310431 |
6 | 1542134404021 |
7 | 210312241405 |
oct | 37551425555 |
9 | 11876462774 |
10 | 4255525741 |
11 | 1894151525 |
12 | 9a9200611 |
13 | 52a84a28c |
14 | 2c526b805 |
15 | 19d8eb7b1 |
hex | fda62b6d |
4255525741 has 8 divisors (see below), whose sum is σ = 4482980480. Its totient is φ = 4028419008.
The previous prime is 4255525723. The next prime is 4255525759. The reversal of 4255525741 is 1475255524.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (4255525723) and next prime (4255525759).
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 4255525741 - 25 = 4255525709 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 4255525694 and 4255525703.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4255525721) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 61701 + ... + 110986.
It is an arithmetic number, because the mean of its divisors is an integer number (560372560).
Almost surely, 24255525741 is an apocalyptic number.
It is an amenable number.
4255525741 is a deficient number, since it is larger than the sum of its proper divisors (227454739).
4255525741 is a wasteful number, since it uses less digits than its factorization.
4255525741 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 174003.
The product of its digits is 280000, while the sum is 40.
The square root of 4255525741 is about 65234.3907843095. The cubic root of 4255525741 is about 1620.5076066428.
The spelling of 4255525741 in words is "four billion, two hundred fifty-five million, five hundred twenty-five thousand, seven hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •