Base | Representation |
---|---|
bin | 10000000010010101000… |
… | …110010111011111000111 |
3 | 10220100111012001221112221 |
4 | 100002111012113133013 |
5 | 121023410323231043 |
6 | 2202131405153211 |
7 | 142421624545441 |
oct | 20022506273707 |
9 | 3810435057487 |
10 | 1102013102023 |
11 | 3953a7737379 |
12 | 1596b1b5b807 |
13 | 7cbc4b8c0c2 |
14 | 3b4a29b3491 |
15 | 1d9ec5a08ed |
hex | 100951977c7 |
1102013102023 has 8 divisors (see below), whose sum is σ = 1181607497280. Its totient is φ = 1024059828480.
The previous prime is 1102013102017. The next prime is 1102013102107. The reversal of 1102013102023 is 3202013102011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1102013102023 - 217 = 1102012970951 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1102013101988 and 1102013102006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1102013102423) 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 7 ways as a sum of consecutive naturals, for example, 410279038 + ... + 410281723.
It is an arithmetic number, because the mean of its divisors is an integer number (147700937160).
Almost surely, 21102013102023 is an apocalyptic number.
1102013102023 is a deficient number, since it is larger than the sum of its proper divisors (79594395257).
1102013102023 is an equidigital number, since it uses as much as digits as its factorization.
1102013102023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 820560857.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 1102013102023 its reverse (3202013102011), we get a palindrome (4304026204034).
The spelling of 1102013102023 in words is "one trillion, one hundred two billion, thirteen million, one hundred two thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.148 sec. • engine limits •