Base | Representation |
---|---|
bin | 11110011010010… |
… | …01101111011101 |
3 | 122210000201122212 |
4 | 33031021233131 |
5 | 1010301343023 |
6 | 41151450205 |
7 | 6215236211 |
oct | 1715115735 |
9 | 583021585 |
10 | 255106013 |
11 | 121000a18 |
12 | 71526965 |
13 | 40b0c806 |
14 | 25c48941 |
15 | 175e1e78 |
hex | f349bdd |
255106013 has 4 divisors (see below), whose sum is σ = 259919388. Its totient is φ = 250292640.
The previous prime is 255106001. The next prime is 255106021. The reversal of 255106013 is 310601552.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 79887844 + 175218169 = 8938^2 + 13237^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-255106013 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 255106013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (255106073) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2406608 + ... + 2406713.
It is an arithmetic number, because the mean of its divisors is an integer number (64979847).
Almost surely, 2255106013 is an apocalyptic number.
It is an amenable number.
255106013 is a deficient number, since it is larger than the sum of its proper divisors (4813375).
255106013 is an equidigital number, since it uses as much as digits as its factorization.
255106013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4813374.
The product of its (nonzero) digits is 900, while the sum is 23.
The square root of 255106013 is about 15972.0384735324. The cubic root of 255106013 is about 634.2204358747.
Adding to 255106013 its reverse (310601552), we get a palindrome (565707565).
The spelling of 255106013 in words is "two hundred fifty-five million, one hundred six thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •