Base | Representation |
---|---|
bin | 10000001100010101000… |
… | …100011110100100101110 |
3 | 10221101012110111010222010 |
4 | 100030111010132210232 |
5 | 121212403001300011 |
6 | 2211105034502050 |
7 | 143251661103054 |
oct | 20142504364456 |
9 | 3841173433863 |
10 | 1112750025006 |
11 | 399a0741a544 |
12 | 15b7a9894926 |
13 | 80c16445a79 |
14 | 3bc009621d4 |
15 | 1de29ec61a6 |
hex | 1031511e92e |
1112750025006 has 8 divisors (see below), whose sum is σ = 2225500050024. Its totient is φ = 370916675000.
The previous prime is 1112750025001. The next prime is 1112750025019. The reversal of 1112750025006 is 6005200572111.
It is a sphenic number, since it is the product of 3 distinct primes.
1112750025006 is an admirable number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1112750025001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 92729168745 + ... + 92729168756.
It is an arithmetic number, because the mean of its divisors is an integer number (278187506253).
Almost surely, 21112750025006 is an apocalyptic number.
1112750025006 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.
1112750025006 is a wasteful number, since it uses less digits than its factorization.
1112750025006 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 185458337506.
The product of its (nonzero) digits is 4200, while the sum is 30.
Adding to 1112750025006 its reverse (6005200572111), we get a palindrome (7117950597117).
The spelling of 1112750025006 in words is "one trillion, one hundred twelve billion, seven hundred fifty million, twenty-five thousand, six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •