Base | Representation |
---|---|
bin | 11011111110010100101111… |
… | …01000100101001100101010 |
3 | 22001210210010200121222211020 |
4 | 31333022113220211030222 |
5 | 31030330323244023200 |
6 | 334455344144313310 |
7 | 15646213446230322 |
oct | 1577122750451452 |
9 | 261723120558736 |
10 | 61515065611050 |
11 | 18667435930017 |
12 | 6a96047012836 |
13 | 2842acc2a3a3c |
14 | 11294b8bc6282 |
15 | 71a2348c1ea0 |
hex | 37f297a2532a |
61515065611050 has 48 divisors (see below), whose sum is σ = 152557842509472. Its totient is φ = 16403965905600.
The previous prime is 61515065611039. The next prime is 61515065611073. The reversal of 61515065611050 is 5011656051516.
It is a junction number, because it is equal to n+sod(n) for n = 61515065610993 and 61515065611011.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 84973212 + ... + 85694088.
It is an arithmetic number, because the mean of its divisors is an integer number (3178288385614).
Almost surely, 261515065611050 is an apocalyptic number.
61515065611050 is an abundant number, since it is smaller than the sum of its proper divisors (91042776898422).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
61515065611050 is a wasteful number, since it uses less digits than its factorization.
61515065611050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1289783 (or 1289778 counting only the distinct ones).
The product of its (nonzero) digits is 135000, while the sum is 42.
The spelling of 61515065611050 in words is "sixty-one trillion, five hundred fifteen billion, sixty-five million, six hundred eleven thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •