Base | Representation |
---|---|
bin | 111001001000011101… |
… | …110011011001000101 |
3 | 12212100021000212010111 |
4 | 321020131303121011 |
5 | 2001113400024443 |
6 | 44103122553021 |
7 | 4301123366020 |
oct | 711035633105 |
9 | 185307025114 |
10 | 61345314373 |
11 | 2401a915722 |
12 | ba80508771 |
13 | 5a2839c8b5 |
14 | 2d7d40c1b7 |
15 | 18e08e469d |
hex | e48773645 |
61345314373 has 4 divisors (see below), whose sum is σ = 70108930720. Its totient is φ = 52581698028.
The previous prime is 61345314319. The next prime is 61345314377. The reversal of 61345314373 is 37341354316.
61345314373 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 61345314373 - 213 = 61345306181 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 (61345314377) 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, 4381808163 + ... + 4381808176.
It is an arithmetic number, because the mean of its divisors is an integer number (17527232680).
Almost surely, 261345314373 is an apocalyptic number.
It is an amenable number.
61345314373 is a deficient number, since it is larger than the sum of its proper divisors (8763616347).
61345314373 is an equidigital number, since it uses as much as digits as its factorization.
61345314373 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8763616346.
The product of its digits is 272160, while the sum is 40.
Adding to 61345314373 its reverse (37341354316), we get a palindrome (98686668689).
The spelling of 61345314373 in words is "sixty-one billion, three hundred forty-five million, three hundred fourteen thousand, three hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •