Base | Representation |
---|---|
bin | 10000001001110011001… |
… | …100111100000101000101 |
3 | 10221010012012102202021112 |
4 | 100021303030330011011 |
5 | 121141322242142041 |
6 | 2205535344054405 |
7 | 143124454105454 |
oct | 20116314740505 |
9 | 3833165382245 |
10 | 1110034334021 |
11 | 398843496728 |
12 | 15b170304405 |
13 | 808a2927322 |
14 | 3ba24006b9b |
15 | 1dd1b891deb |
hex | 1027333c145 |
1110034334021 has 8 divisors (see below), whose sum is σ = 1114376127744. Its totient is φ = 1105693458480.
The previous prime is 1110034334011. The next prime is 1110034334033. The reversal of 1110034334021 is 1204334300111.
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 1110034334021 - 210 = 1110034332997 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1110034334011) 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 7 ways as a sum of consecutive naturals, for example, 2245115 + ... + 2694551.
It is an arithmetic number, because the mean of its divisors is an integer number (139297015968).
Almost surely, 21110034334021 is an apocalyptic number.
It is an amenable number.
1110034334021 is a deficient number, since it is larger than the sum of its proper divisors (4341793723).
1110034334021 is an equidigital number, since it uses as much as digits as its factorization.
1110034334021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 459091.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 1110034334021 its reverse (1204334300111), we get a palindrome (2314368634132).
The spelling of 1110034334021 in words is "one trillion, one hundred ten billion, thirty-four million, three hundred thirty-four thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •