Base | Representation |
---|---|
bin | 11011111000100000001010… |
… | …11001001010111010000011 |
3 | 22001002122211210221010122201 |
4 | 31330100011121022322003 |
5 | 31014041202130231201 |
6 | 334223424150414031 |
7 | 15625602640216201 |
oct | 1574200531127203 |
9 | 261078753833581 |
10 | 61315043602051 |
11 | 1859a6226a7168 |
12 | 6a63324061317 |
13 | 2829ca3549bb5 |
14 | 111d941c16071 |
15 | 714e29551801 |
hex | 37c40564ae83 |
61315043602051 has 4 divisors (see below), whose sum is σ = 61409811830832. Its totient is φ = 61220275373272.
The previous prime is 61315043602003. The next prime is 61315043602061. The reversal of 61315043602051 is 15020634051316.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-61315043602051 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 61315043602051.
It is not an unprimeable number, because it can be changed into a prime (61315043602061) 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, 47384113420 + ... + 47384114713.
It is an arithmetic number, because the mean of its divisors is an integer number (15352452957708).
Almost surely, 261315043602051 is an apocalyptic number.
61315043602051 is a deficient number, since it is larger than the sum of its proper divisors (94768228781).
61315043602051 is an equidigital number, since it uses as much as digits as its factorization.
61315043602051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 94768228780.
The product of its (nonzero) digits is 64800, while the sum is 37.
Adding to 61315043602051 its reverse (15020634051316), we get a palindrome (76335677653367).
The spelling of 61315043602051 in words is "sixty-one trillion, three hundred fifteen billion, forty-three million, six hundred two thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •