Base | Representation |
---|---|
bin | 10000001001110011101… |
… | …110110100000010111010 |
3 | 10221010012211010220100000 |
4 | 100021303232310002322 |
5 | 121141332030322020 |
6 | 2205540302253430 |
7 | 143124622431603 |
oct | 20116356640272 |
9 | 3833184126300 |
10 | 1110043214010 |
11 | 398848501365 |
12 | 15b173287276 |
13 | 808a4716163 |
14 | 3ba25278daa |
15 | 1dd1c548090 |
hex | 10273bb40ba |
1110043214010 has 48 divisors (see below), whose sum is σ = 2993005413216. Its totient is φ = 296011523088.
The previous prime is 1110043213967. The next prime is 1110043214011. The reversal of 1110043214010 is 104123400111.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is not an unprimeable number, because it can be changed into a prime (1110043214011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 228401524 + ... + 228406383.
It is an arithmetic number, because the mean of its divisors is an integer number (62354279442).
Almost surely, 21110043214010 is an apocalyptic number.
1110043214010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1110043214010 is an abundant number, since it is smaller than the sum of its proper divisors (1882962199206).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1110043214010 is an equidigital number, since it uses as much as digits as its factorization.
1110043214010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 456807929 (or 456807917 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 18.
Adding to 1110043214010 its reverse (104123400111), we get a palindrome (1214166614121).
The spelling of 1110043214010 in words is "one trillion, one hundred ten billion, forty-three million, two hundred fourteen thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •