Base | Representation |
---|---|
bin | 110011101100111110… |
… | …1101100101100011011 |
3 | 101121120221102211010021 |
4 | 1213121331230230123 |
5 | 3304342414341443 |
6 | 123001255531311 |
7 | 11010311013463 |
oct | 1473175545433 |
9 | 347527384107 |
10 | 111031012123 |
11 | 430a7125849 |
12 | 19628089b37 |
13 | a615ca4955 |
14 | 55340c4ba3 |
15 | 2d4c8a29ed |
hex | 19d9f6cb1b |
111031012123 has 8 divisors (see below), whose sum is σ = 113644072256. Its totient is φ = 108419358600.
The previous prime is 111031012109. The next prime is 111031012129. The reversal of 111031012123 is 321210130111.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 111031012123 - 25 = 111031012091 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 111031012097 and 111031012106.
It is not an unprimeable number, because it can be changed into a prime (111031012129) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 191073 + ... + 508498.
It is an arithmetic number, because the mean of its divisors is an integer number (14205509032).
Almost surely, 2111031012123 is an apocalyptic number.
111031012123 is a deficient number, since it is larger than the sum of its proper divisors (2613060133).
111031012123 is an equidigital number, since it uses as much as digits as its factorization.
111031012123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 703305.
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 111031012123 its reverse (321210130111), we get a palindrome (432241142234).
The spelling of 111031012123 in words is "one hundred eleven billion, thirty-one million, twelve thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •