Base | Representation |
---|---|
bin | 111001001100000111… |
… | …001000110000100100 |
3 | 12212111112010110120120 |
4 | 321030013020300210 |
5 | 2001230024401234 |
6 | 44113150001540 |
7 | 4302465323460 |
oct | 711407106044 |
9 | 185445113516 |
10 | 61406481444 |
11 | 240513a3420 |
12 | ba98aa62b0 |
13 | 5a37c67b29 |
14 | 2d875b14a0 |
15 | 18e5e78049 |
hex | e4c1c8c24 |
61406481444 has 192 divisors, whose sum is σ = 192414351360. Its totient is φ = 14758692480.
The previous prime is 61406481443. The next prime is 61406481449. The reversal of 61406481444 is 44418460416.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a junction number, because it is equal to n+sod(n) for n = 61406481396 and 61406481405.
It is not an unprimeable number, because it can be changed into a prime (61406481443) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 714237 + ... + 795579.
It is an arithmetic number, because the mean of its divisors is an integer number (1002158080).
Almost surely, 261406481444 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 61406481444, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (96207175680).
61406481444 is an abundant number, since it is smaller than the sum of its proper divisors (131007869916).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
61406481444 is a wasteful number, since it uses less digits than its factorization.
61406481444 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 81430 (or 81428 counting only the distinct ones).
The product of its (nonzero) digits is 294912, while the sum is 42.
The spelling of 61406481444 in words is "sixty-one billion, four hundred six million, four hundred eighty-one thousand, four hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •