Base | Representation |
---|---|
bin | 111001001000110100… |
… | …100001011001110000 |
3 | 12212100200020102201021 |
4 | 321020310201121300 |
5 | 2001121411120000 |
6 | 44103454345224 |
7 | 4301225122246 |
oct | 711064413160 |
9 | 185320212637 |
10 | 61351270000 |
11 | 24023213229 |
12 | ba824bb214 |
13 | 5a296a6637 |
14 | 2d8011c796 |
15 | 18e11be11a |
hex | e48d21670 |
61351270000 has 100 divisors (see below), whose sum is σ = 149051631960. Its totient is φ = 24455584000.
The previous prime is 61351269997. The next prime is 61351270027. The reversal of 61351270000 is 7215316.
It is a tau number, because it is divible by the number of its divisors (100).
It is a super-2 number, since 2×613512700002 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 2919531 + ... + 2940469.
Almost surely, 261351270000 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 61351270000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (74525815980).
61351270000 is an abundant number, since it is smaller than the sum of its proper divisors (87700361960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
61351270000 is a wasteful number, since it uses less digits than its factorization.
61351270000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21260 (or 21239 counting only the distinct ones).
The product of its (nonzero) digits is 1260, while the sum is 25.
Adding to 61351270000 its reverse (7215316), we get a palindrome (61358485316).
The spelling of 61351270000 in words is "sixty-one billion, three hundred fifty-one million, two hundred seventy thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •