Base | Representation |
---|---|
bin | 10111010111001000… |
… | …01100010000100110 |
3 | 1012101002010001111210 |
4 | 23223210030100212 |
5 | 201141232132000 |
6 | 5432312012250 |
7 | 622542550122 |
oct | 135344142046 |
9 | 35332101453 |
10 | 12542067750 |
11 | 5356741153 |
12 | 2520391086 |
13 | 124b558684 |
14 | 86da04582 |
15 | 4d6148350 |
hex | 2eb90c426 |
12542067750 has 128 divisors (see below), whose sum is σ = 31980469248. Its totient is φ = 3273177600.
The previous prime is 12542067749. The next prime is 12542067757. The reversal of 12542067750 is 5776024521.
It is a junction number, because it is equal to n+sod(n) for n = 12542067699 and 12542067708.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12542067757) 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, 7033359 + ... + 7035141.
It is an arithmetic number, because the mean of its divisors is an integer number (249847416).
Almost surely, 212542067750 is an apocalyptic number.
12542067750 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 12542067750, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15990234624).
12542067750 is an abundant number, since it is smaller than the sum of its proper divisors (19438401498).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12542067750 is a wasteful number, since it uses less digits than its factorization.
12542067750 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1999 (or 1989 counting only the distinct ones).
The product of its (nonzero) digits is 117600, while the sum is 39.
The spelling of 12542067750 in words is "twelve billion, five hundred forty-two million, sixty-seven thousand, seven hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •