Base | Representation |
---|---|
bin | 110001000101001111… |
… | …0000010001011011000 |
3 | 101002001200002212020011 |
4 | 1202022132002023120 |
5 | 3211331000003102 |
6 | 120230550011304 |
7 | 10420653100000 |
oct | 1421236021330 |
9 | 332050085204 |
10 | 105402344152 |
11 | 4077896a236 |
12 | 18517046b34 |
13 | 9c29b208a1 |
14 | 515c737000 |
15 | 2b1d6692d7 |
hex | 188a7822d8 |
105402344152 has 96 divisors (see below), whose sum is σ = 233507750400. Its totient is φ = 44596135584.
The previous prime is 105402344129. The next prime is 105402344161. The reversal of 105402344152 is 251443204501.
It is a super-2 number, since 2×1054023441522 (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 23 ways as a sum of consecutive naturals, for example, 10617063 + ... + 10626985.
It is an arithmetic number, because the mean of its divisors is an integer number (2432372400).
Almost surely, 2105402344152 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 105402344152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (116753875200).
105402344152 is an abundant number, since it is smaller than the sum of its proper divisors (128105406248).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105402344152 is an frugal number, since it uses more digits than its factorization.
105402344152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10043 (or 10011 counting only the distinct ones).
The product of its (nonzero) digits is 19200, while the sum is 31.
Adding to 105402344152 its reverse (251443204501), we get a palindrome (356845548653).
The spelling of 105402344152 in words is "one hundred five billion, four hundred two million, three hundred forty-four thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •