Base | Representation |
---|---|
bin | 111001001011111110… |
… | …001110000111100110 |
3 | 12212111100201201100100 |
4 | 321023332032013212 |
5 | 2001223430102402 |
6 | 44113023524530 |
7 | 4302436420200 |
oct | 711376160746 |
9 | 185440651310 |
10 | 61404144102 |
11 | 24050047334 |
12 | ba98159746 |
13 | 5a37629ca2 |
14 | 2d87163770 |
15 | 18e5b6571c |
hex | e4bf8e1e6 |
61404144102 has 216 divisors, whose sum is σ = 168633721152. Its totient is φ = 16081934400.
The previous prime is 61404144089. The next prime is 61404144119. The reversal of 61404144102 is 20144140416.
61404144102 is a `hidden beast` number, since 6 + 140 + 414 + 4 + 102 = 666.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 107 ways as a sum of consecutive naturals, for example, 9867352 + ... + 9873572.
It is an arithmetic number, because the mean of its divisors is an integer number (780711672).
Almost surely, 261404144102 is an apocalyptic number.
61404144102 is a gapful number since it is divisible by the number (62) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 61404144102, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (84316860576).
61404144102 is an abundant number, since it is smaller than the sum of its proper divisors (107229577050).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
61404144102 is a wasteful number, since it uses less digits than its factorization.
61404144102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6312 (or 6283 counting only the distinct ones).
The product of its (nonzero) digits is 3072, while the sum is 27.
Adding to 61404144102 its reverse (20144140416), we get a palindrome (81548284518).
The spelling of 61404144102 in words is "sixty-one billion, four hundred four million, one hundred forty-four thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •