Base | Representation |
---|---|
bin | 111001010000100011… |
… | …110010011111000101 |
3 | 12212200201112112201012 |
4 | 321100203302133011 |
5 | 2001403130220003 |
6 | 44124413212005 |
7 | 4304362511105 |
oct | 712043623705 |
9 | 185621475635 |
10 | 61481101253 |
11 | 2408a52a390 |
12 | bab9a91005 |
13 | 5a4a563370 |
14 | 2d93477205 |
15 | 18ec7b78d8 |
hex | e508f27c5 |
61481101253 has 8 divisors (see below), whose sum is σ = 72229545696. Its totient is φ = 51592532400.
The previous prime is 61481101219. The next prime is 61481101267. The reversal of 61481101253 is 35210118416.
61481101253 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 61481101253 - 214 = 61481084869 is a prime.
It is a super-2 number, since 2×614811012532 (a number of 22 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (61481101153) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 214968743 + ... + 214969028.
It is an arithmetic number, because the mean of its divisors is an integer number (9028693212).
Almost surely, 261481101253 is an apocalyptic number.
It is an amenable number.
61481101253 is a deficient number, since it is larger than the sum of its proper divisors (10748444443).
61481101253 is a wasteful number, since it uses less digits than its factorization.
61481101253 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 429937795.
The product of its (nonzero) digits is 5760, while the sum is 32.
Adding to 61481101253 its reverse (35210118416), we get a palindrome (96691219669).
The spelling of 61481101253 in words is "sixty-one billion, four hundred eighty-one million, one hundred one thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •