Base | Representation |
---|---|
bin | 11110011001110… |
… | …01111110000101 |
3 | 122202220110001021 |
4 | 33030321332011 |
5 | 1010242311123 |
6 | 41150231141 |
7 | 6214546654 |
oct | 1714717605 |
9 | 582813037 |
10 | 255041413 |
11 | 120a67430 |
12 | 714b54b1 |
13 | 40ab92a3 |
14 | 25c2d19b |
15 | 175ccc5d |
hex | f339f85 |
255041413 has 8 divisors (see below), whose sum is σ = 278804160. Its totient is φ = 231374880.
The previous prime is 255041401. The next prime is 255041417. The reversal of 255041413 is 314140552.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 255041413 - 221 = 252944261 is a prime.
It is a super-2 number, since 2×2550414132 = 130092244690073138, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (255041417) 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, 18448 + ... + 29161.
It is an arithmetic number, because the mean of its divisors is an integer number (34850520).
Almost surely, 2255041413 is an apocalyptic number.
It is an amenable number.
255041413 is a deficient number, since it is larger than the sum of its proper divisors (23762747).
255041413 is a wasteful number, since it uses less digits than its factorization.
255041413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48107.
The product of its (nonzero) digits is 2400, while the sum is 25.
The square root of 255041413 is about 15970.0160613570. The cubic root of 255041413 is about 634.1668972191.
Adding to 255041413 its reverse (314140552), we get a palindrome (569181965).
The spelling of 255041413 in words is "two hundred fifty-five million, forty-one thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •