Base | Representation |
---|---|
bin | 10000000010011010111… |
… | …001101011101111010011 |
3 | 10220100201222020020201010 |
4 | 100002122321223233103 |
5 | 121024110233043103 |
6 | 2202145203342003 |
7 | 142424216114010 |
oct | 20023271535723 |
9 | 3810658206633 |
10 | 1102110440403 |
11 | 395447680115 |
12 | 15971a681903 |
13 | 7cc0c0b028b |
14 | 3b4b18b0707 |
15 | 1da05dcb903 |
hex | 1009ae6bbd3 |
1102110440403 has 16 divisors (see below), whose sum is σ = 1699640199936. Its totient is φ = 622189714080.
The previous prime is 1102110440399. The next prime is 1102110440423. The reversal of 1102110440403 is 3040440112011.
It is not a de Polignac number, because 1102110440403 - 22 = 1102110440399 is a prime.
It is a super-2 number, since 2×11021104404032 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a self number, because there is not a number n which added to its sum of digits gives 1102110440403.
It is not an unprimeable number, because it can be changed into a prime (1102110440423) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 316151568 + ... + 316155053.
It is an arithmetic number, because the mean of its divisors is an integer number (106227512496).
Almost surely, 21102110440403 is an apocalyptic number.
1102110440403 is a deficient number, since it is larger than the sum of its proper divisors (597529759533).
1102110440403 is an equidigital number, since it uses as much as digits as its factorization.
1102110440403 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 632306714.
The product of its (nonzero) digits is 384, while the sum is 21.
Adding to 1102110440403 its reverse (3040440112011), we get a palindrome (4142550552414).
The spelling of 1102110440403 in words is "one trillion, one hundred two billion, one hundred ten million, four hundred forty thousand, four hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •