Base | Representation |
---|---|
bin | 111000110101000101… |
… | …010110000011010000 |
3 | 12211111121011001202102 |
4 | 320311011112003100 |
5 | 1444432123320012 |
6 | 44010545135532 |
7 | 4260064411031 |
oct | 706505260320 |
9 | 184447131672 |
10 | 61020135632 |
11 | 23973304065 |
12 | b9ab62a5a8 |
13 | 59a5bc7441 |
14 | 2d4c162a88 |
15 | 18c20b02c2 |
hex | e351560d0 |
61020135632 has 40 divisors (see below), whose sum is σ = 126248586240. Its totient is φ = 28507731840.
The previous prime is 61020135629. The next prime is 61020135641. The reversal of 61020135632 is 23653102016.
It is a Harshad number since it is a multiple of its sum of digits (29).
It is a junction number, because it is equal to n+sod(n) for n = 61020135595 and 61020135604.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2106728 + ... + 2135495.
It is an arithmetic number, because the mean of its divisors is an integer number (3156214656).
Almost surely, 261020135632 is an apocalyptic number.
61020135632 is a gapful number since it is divisible by the number (62) formed by its first and last digit.
It is an amenable number.
61020135632 is an abundant number, since it is smaller than the sum of its proper divisors (65228450608).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
61020135632 is a wasteful number, since it uses less digits than its factorization.
61020135632 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4242291 (or 4242285 counting only the distinct ones).
The product of its (nonzero) digits is 6480, while the sum is 29.
Adding to 61020135632 its reverse (23653102016), we get a palindrome (84673237648).
The spelling of 61020135632 in words is "sixty-one billion, twenty million, one hundred thirty-five thousand, six hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •