Base | Representation |
---|---|
bin | 110001001110110101… |
… | …0101111001101111000 |
3 | 101002220010012002200020 |
4 | 1202131222233031320 |
5 | 3213010424111324 |
6 | 120322533410440 |
7 | 10431643632135 |
oct | 1423552571570 |
9 | 332803162606 |
10 | 105724441464 |
11 | 40923766764 |
12 | 185a6a99a20 |
13 | 9c7b787605 |
14 | 518d41d58c |
15 | 2b3ba90679 |
hex | 189daaf378 |
105724441464 has 128 divisors (see below), whose sum is σ = 284464327680. Its totient is φ = 32626944000.
The previous prime is 105724441457. The next prime is 105724441477. The reversal of 105724441464 is 464144427501.
It is a super-2 number, since 2×1057244414642 (a number of 23 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 31 ways as a sum of consecutive naturals, for example, 6337294 + ... + 6353954.
It is an arithmetic number, because the mean of its divisors is an integer number (2222377560).
Almost surely, 2105724441464 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 105724441464, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (142232163840).
105724441464 is an abundant number, since it is smaller than the sum of its proper divisors (178739886216).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105724441464 is a wasteful number, since it uses less digits than its factorization.
105724441464 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16941 (or 16937 counting only the distinct ones).
The product of its (nonzero) digits is 430080, while the sum is 42.
Adding to 105724441464 its reverse (464144427501), we get a palindrome (569868868965).
The spelling of 105724441464 in words is "one hundred five billion, seven hundred twenty-four million, four hundred forty-one thousand, four hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •