Base | Representation |
---|---|
bin | 10000001001110111110… |
… | …101101011000111101011 |
3 | 10221010101121210202101201 |
4 | 100021313311223013223 |
5 | 121142002200340243 |
6 | 2205551203225031 |
7 | 143126420224552 |
oct | 20116765530753 |
9 | 3833347722351 |
10 | 1110112121323 |
11 | 398883396457 |
12 | 15b192378177 |
13 | 808b5a9150a |
14 | 3ba30494d99 |
15 | 1dd2360a04d |
hex | 10277d6b1eb |
1110112121323 has 16 divisors (see below), whose sum is σ = 1215147558240. Its totient is φ = 1009992646656.
The previous prime is 1110112121317. The next prime is 1110112121341. The reversal of 1110112121323 is 3231212110111.
It is a cyclic number.
It is not a de Polignac number, because 1110112121323 - 29 = 1110112120811 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1110112121323.
It is not an unprimeable number, because it can be changed into a prime (1110112121123) 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 15 ways as a sum of consecutive naturals, for example, 7757038 + ... + 7898851.
It is an arithmetic number, because the mean of its divisors is an integer number (75946722390).
Almost surely, 21110112121323 is an apocalyptic number.
1110112121323 is a deficient number, since it is larger than the sum of its proper divisors (105035436917).
1110112121323 is a wasteful number, since it uses less digits than its factorization.
1110112121323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15656046.
The product of its (nonzero) digits is 72, while the sum is 19.
Adding to 1110112121323 its reverse (3231212110111), we get a palindrome (4341324231434).
The spelling of 1110112121323 in words is "one trillion, one hundred ten billion, one hundred twelve million, one hundred twenty-one thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •