Base | Representation |
---|---|
bin | 11011101111101000111011… |
… | …00010011101000111011101 |
3 | 22000000112210001201121022112 |
4 | 31313310131202131013131 |
5 | 30444044004014323401 |
6 | 333431501201123405 |
7 | 15564602133340433 |
oct | 1567643542350735 |
9 | 260015701647275 |
10 | 61010506011101 |
11 | 184924571146a9 |
12 | 6a142b3029565 |
13 | 280735c61263a |
14 | 110ccd21c0d53 |
15 | 70c05382b3bb |
hex | 377d1d89d1dd |
61010506011101 has 4 divisors (see below), whose sum is σ = 61105390157952. Its totient is φ = 60915621864252.
The previous prime is 61010506011053. The next prime is 61010506011109. The reversal of 61010506011101 is 10111060501016.
It is a happy number.
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 61010506011101 - 214 = 61010505994717 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (61010506011109) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 47442072461 + ... + 47442073746.
It is an arithmetic number, because the mean of its divisors is an integer number (15276347539488).
Almost surely, 261010506011101 is an apocalyptic number.
It is an amenable number.
61010506011101 is a deficient number, since it is larger than the sum of its proper divisors (94884146851).
61010506011101 is an equidigital number, since it uses as much as digits as its factorization.
61010506011101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 94884146850.
The product of its (nonzero) digits is 180, while the sum is 23.
Adding to 61010506011101 its reverse (10111060501016), we get a palindrome (71121566512117).
The spelling of 61010506011101 in words is "sixty-one trillion, ten billion, five hundred six million, eleven thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •