Base | Representation |
---|---|
bin | 11100010001010000010001… |
… | …010101000111110001010110 |
3 | 121022012221001102221212220020 |
4 | 130101100101111013301112 |
5 | 112244014344013043014 |
6 | 1120232512540050010 |
7 | 35121422120104002 |
oct | 3421202125076126 |
9 | 538187042855806 |
10 | 124331004034134 |
11 | 36685534524887 |
12 | 11b40221833906 |
13 | 544b495439521 |
14 | 229b91d037702 |
15 | e59204b251a9 |
hex | 711411547c56 |
124331004034134 has 8 divisors (see below), whose sum is σ = 248662008068280. Its totient is φ = 41443668011376.
The previous prime is 124331004034109. The next prime is 124331004034141. The reversal of 124331004034134 is 431430400133421.
It is a sphenic number, since it is the product of 3 distinct primes.
124331004034134 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 124331004034095 and 124331004034104.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10360917002839 + ... + 10360917002850.
It is an arithmetic number, because the mean of its divisors is an integer number (31082751008535).
Almost surely, 2124331004034134 is an apocalyptic number.
124331004034134 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
124331004034134 is a wasteful number, since it uses less digits than its factorization.
124331004034134 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20721834005694.
The product of its (nonzero) digits is 41472, while the sum is 33.
Adding to 124331004034134 its reverse (431430400133421), we get a palindrome (555761404167555).
The spelling of 124331004034134 in words is "one hundred twenty-four trillion, three hundred thirty-one billion, four million, thirty-four thousand, one hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •