Base | Representation |
---|---|
bin | 111001111001110001… |
… | …0111100111000011010 |
3 | 102212221211021001221000 |
4 | 1303303202330320122 |
5 | 4014124322010132 |
6 | 133042351125430 |
7 | 11661246665466 |
oct | 1636342747032 |
9 | 385854231830 |
10 | 124345110042 |
11 | 4880963365a |
12 | 20122b13876 |
13 | b95846c2ba |
14 | 60384534a6 |
15 | 337b69a87c |
hex | 1cf38bce1a |
124345110042 has 128 divisors (see below), whose sum is σ = 297155174400. Its totient is φ = 38468476800.
The previous prime is 124345110037. The next prime is 124345110061. The reversal of 124345110042 is 240011543421.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 124345109988 and 124345110015.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 4034053 + ... + 4064759.
It is an arithmetic number, because the mean of its divisors is an integer number (2321524800).
Almost surely, 2124345110042 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 124345110042, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (148577587200).
124345110042 is an abundant number, since it is smaller than the sum of its proper divisors (172810064358).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
124345110042 is a wasteful number, since it uses less digits than its factorization.
124345110042 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30849 (or 30843 counting only the distinct ones).
The product of its (nonzero) digits is 3840, while the sum is 27.
Adding to 124345110042 its reverse (240011543421), we get a palindrome (364356653463).
The spelling of 124345110042 in words is "one hundred twenty-four billion, three hundred forty-five million, one hundred ten thousand, forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •