Base | Representation |
---|---|
bin | 111001001010001101… |
… | …010101101000111100 |
3 | 12212102022001022111010 |
4 | 321022031111220330 |
5 | 2001143341141021 |
6 | 44110045355220 |
7 | 4301630042535 |
oct | 711215255074 |
9 | 185368038433 |
10 | 61374552636 |
11 | 24035375881 |
12 | ba8a268b10 |
13 | 5a31468c47 |
14 | 2d8325d68c |
15 | 18e326c976 |
hex | e4a355a3c |
61374552636 has 48 divisors (see below), whose sum is σ = 148349859840. Its totient is φ = 19725478080.
The previous prime is 61374552623. The next prime is 61374552667. The reversal of 61374552636 is 63625547316.
61374552636 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×613745526362 (a number of 22 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 131701 + ... + 374291.
It is an arithmetic number, because the mean of its divisors is an integer number (3090622080).
Almost surely, 261374552636 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 61374552636, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (74174929920).
61374552636 is an abundant number, since it is smaller than the sum of its proper divisors (86975307204).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
61374552636 is a wasteful number, since it uses less digits than its factorization.
61374552636 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 243354 (or 243352 counting only the distinct ones).
The product of its digits is 2721600, while the sum is 48.
The spelling of 61374552636 in words is "sixty-one billion, three hundred seventy-four million, five hundred fifty-two thousand, six hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •