Base | Representation |
---|---|
bin | 10111101111111111… |
… | …000000111011110001 |
3 | 2102211012211121111121 |
4 | 113233333000323301 |
5 | 404211241010001 |
6 | 15414241142241 |
7 | 1561640600323 |
oct | 275777007361 |
9 | 72735747447 |
10 | 25501110001 |
11 | a8a6791424 |
12 | 4b3832a981 |
13 | 25352b9903 |
14 | 133cb4b613 |
15 | 9e3ba96a1 |
hex | 5effc0ef1 |
25501110001 has 4 divisors (see below), whose sum is σ = 25521049600. Its totient is φ = 25481170404.
The previous prime is 25501109971. The next prime is 25501110029. The reversal of 25501110001 is 10001110552.
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 25501110001 - 211 = 25501107953 is a prime.
It is a super-2 number, since 2×255011100012 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (25501119001) 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 3 ways as a sum of consecutive naturals, for example, 9967881 + ... + 9970438.
It is an arithmetic number, because the mean of its divisors is an integer number (6380262400).
Almost surely, 225501110001 is an apocalyptic number.
It is an amenable number.
25501110001 is a deficient number, since it is larger than the sum of its proper divisors (19939599).
25501110001 is a wasteful number, since it uses less digits than its factorization.
25501110001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19939598.
The product of its (nonzero) digits is 50, while the sum is 16.
Adding to 25501110001 its reverse (10001110552), we get a palindrome (35502220553).
The spelling of 25501110001 in words is "twenty-five billion, five hundred one million, one hundred ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •