Base | Representation |
---|---|
bin | 1111001110001011111… |
… | …1100110111101000001 |
3 | 220222222211100200002022 |
4 | 3303202333212331001 |
5 | 13241031112110301 |
6 | 320045004531225 |
7 | 24615241261106 |
oct | 3634277467501 |
9 | 828884320068 |
10 | 261506363201 |
11 | a09a4585226 |
12 | 42821b50b15 |
13 | 1b876b88a25 |
14 | c92aa52aad |
15 | 6c0807bd1b |
hex | 3ce2fe6f41 |
261506363201 has 8 divisors (see below), whose sum is σ = 261982226880. Its totient is φ = 261030922768.
The previous prime is 261506363117. The next prime is 261506363203. The reversal of 261506363201 is 102363605162.
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 261506363201 - 210 = 261506362177 is a prime.
It is a super-2 number, since 2×2615063632012 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (261506363203) 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, 1144415 + ... + 1353771.
It is an arithmetic number, because the mean of its divisors is an integer number (32747778360).
Almost surely, 2261506363201 is an apocalyptic number.
It is an amenable number.
261506363201 is a deficient number, since it is larger than the sum of its proper divisors (475863679).
261506363201 is a wasteful number, since it uses less digits than its factorization.
261506363201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 211623.
The product of its (nonzero) digits is 38880, while the sum is 35.
Adding to 261506363201 its reverse (102363605162), we get a palindrome (363869968363).
The spelling of 261506363201 in words is "two hundred sixty-one billion, five hundred six million, three hundred sixty-three thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •