Base | Representation |
---|---|
bin | 11110110000011… |
… | …00100001101001 |
3 | 122222110210211122 |
4 | 33120030201221 |
5 | 1012022013001 |
6 | 41333505025 |
7 | 6251654336 |
oct | 1730144151 |
9 | 588423748 |
10 | 258001001 |
11 | 1226a8a75 |
12 | 724a2175 |
13 | 415b441b |
14 | 2639d98d |
15 | 179b4b1b |
hex | f60c869 |
258001001 has 4 divisors (see below), whose sum is σ = 263490432. Its totient is φ = 252511572.
The previous prime is 258000991. The next prime is 258001013. The reversal of 258001001 is 100100852.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 258001001 - 26 = 258000937 is a prime.
It is a Duffinian number.
258001001 is a modest number, since divided by 1001 gives 258 as remainder.
It is not an unprimeable number, because it can be changed into a prime (258001021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2744645 + ... + 2744738.
It is an arithmetic number, because the mean of its divisors is an integer number (65872608).
Almost surely, 2258001001 is an apocalyptic number.
It is an amenable number.
258001001 is a deficient number, since it is larger than the sum of its proper divisors (5489431).
258001001 is an equidigital number, since it uses as much as digits as its factorization.
258001001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5489430.
The product of its (nonzero) digits is 80, while the sum is 17.
The square root of 258001001 is about 16062.4095639477. The cubic root of 258001001 is about 636.6104993562.
Adding to 258001001 its reverse (100100852), we get a palindrome (358101853).
The spelling of 258001001 in words is "two hundred fifty-eight million, one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •