Base | Representation |
---|---|
bin | 1110100111001101000… |
… | …1100111111011011001 |
3 | 212222222120000011200201 |
4 | 3221303101213323121 |
5 | 13103113234244001 |
6 | 311154355302201 |
7 | 24065025444634 |
oct | 3516321477331 |
9 | 788876004621 |
10 | 251042103001 |
11 | 975147a46a8 |
12 | 407a15aa961 |
13 | 1a899c4aba1 |
14 | c216d9cc1b |
15 | 67e4565501 |
hex | 3a73467ed9 |
251042103001 has 8 divisors (see below), whose sum is σ = 251826228000. Its totient is φ = 250258619520.
The previous prime is 251042102951. The next prime is 251042103017. The reversal of 251042103001 is 100301240152.
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 251042103001 - 225 = 251008548569 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 251042103001.
It is not an unprimeable number, because it can be changed into a prime (251042103701) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 629550 + ... + 947848.
It is an arithmetic number, because the mean of its divisors is an integer number (31478278500).
Almost surely, 2251042103001 is an apocalyptic number.
It is an amenable number.
251042103001 is a deficient number, since it is larger than the sum of its proper divisors (784124999).
251042103001 is a wasteful number, since it uses less digits than its factorization.
251042103001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 320759.
The product of its (nonzero) digits is 240, while the sum is 19.
Adding to 251042103001 its reverse (100301240152), we get a palindrome (351343343153).
The spelling of 251042103001 in words is "two hundred fifty-one billion, forty-two million, one hundred three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •