Base | Representation |
---|---|
bin | 10000001010000100011… |
… | …010001001100111111011 |
3 | 10221010221022122000100001 |
4 | 100022010122021213323 |
5 | 121142420142310133 |
6 | 2210024135253431 |
7 | 143134560602512 |
oct | 20120432114773 |
9 | 3833838560301 |
10 | 1110323010043 |
11 | 398981436255 |
12 | 15b230b1a277 |
13 | 8091a68ba40 |
14 | 3ba504ad679 |
15 | 1dd36db587d |
hex | 102846899fb |
1110323010043 has 8 divisors (see below), whose sum is σ = 1197918462608. Its totient is φ = 1023039841824.
The previous prime is 1110323010001. The next prime is 1110323010053. The reversal of 1110323010043 is 3400103230111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1110323010043 - 217 = 1110322878971 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 1110323010043.
It is not an unprimeable number, because it can be changed into a prime (1110323010053) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 78063696 + ... + 78077917.
It is an arithmetic number, because the mean of its divisors is an integer number (149739807826).
Almost surely, 21110323010043 is an apocalyptic number.
1110323010043 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
1110323010043 is a deficient number, since it is larger than the sum of its proper divisors (87595452565).
1110323010043 is a wasteful number, since it uses less digits than its factorization.
1110323010043 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 156142173.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 1110323010043 its reverse (3400103230111), we get a palindrome (4510426240154).
The spelling of 1110323010043 in words is "one trillion, one hundred ten billion, three hundred twenty-three million, ten thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •