Base | Representation |
---|---|
bin | 10000000010111110111… |
… | …010111010000110010111 |
3 | 10220102022002022220111000 |
4 | 100002332322322012113 |
5 | 121031324433204033 |
6 | 2202325151514343 |
7 | 142445204434521 |
oct | 20027672720627 |
9 | 3812262286430 |
10 | 1102714741143 |
11 | 3957277a6214 |
12 | 159868b289b3 |
13 | 7cca7353592 |
14 | 3b52bc56a11 |
15 | 1da3de98a13 |
hex | 100beeba197 |
1102714741143 has 32 divisors (see below), whose sum is σ = 1668938987520. Its totient is φ = 719273697120.
The previous prime is 1102714741087. The next prime is 1102714741151. The reversal of 1102714741143 is 3411474172011.
1102714741143 is a `hidden beast` number, since 1 + 1 + 0 + 2 + 71 + 474 + 114 + 3 = 666.
It is not a de Polignac number, because 1102714741143 - 240 = 3203113367 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1102714741098 and 1102714741107.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1102714741043) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3913221 + ... + 4185537.
It is an arithmetic number, because the mean of its divisors is an integer number (52154343360).
Almost surely, 21102714741143 is an apocalyptic number.
1102714741143 is a deficient number, since it is larger than the sum of its proper divisors (566224246377).
1102714741143 is a wasteful number, since it uses less digits than its factorization.
1102714741143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 275564 (or 275558 counting only the distinct ones).
The product of its (nonzero) digits is 18816, while the sum is 36.
The spelling of 1102714741143 in words is "one trillion, one hundred two billion, seven hundred fourteen million, seven hundred forty-one thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •