Base | Representation |
---|---|
bin | 10000000010100001000… |
… | …110010110001100111001 |
3 | 10220101000012220010111111 |
4 | 100002201012112030321 |
5 | 121024313343021403 |
6 | 2202203400200321 |
7 | 142426621005211 |
oct | 20024106261471 |
9 | 3811005803444 |
10 | 1102214423353 |
11 | 3954a034203a |
12 | 1597494690a1 |
13 | 7cc277b9954 |
14 | 3b4c161b241 |
15 | 1da100bb56d |
hex | 100a1196339 |
1102214423353 has 4 divisors (see below), whose sum is σ = 1104990782500. Its totient is φ = 1099438064208.
The previous prime is 1102214423263. The next prime is 1102214423357. The reversal of 1102214423353 is 3533244122011.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 524808966969 + 577405456384 = 724437^2 + 759872^2 .
It is a cyclic number.
It is not a de Polignac number, because 1102214423353 - 213 = 1102214415161 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1102214423357) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1388178978 + ... + 1388179771.
It is an arithmetic number, because the mean of its divisors is an integer number (276247695625).
Almost surely, 21102214423353 is an apocalyptic number.
It is an amenable number.
1102214423353 is a deficient number, since it is larger than the sum of its proper divisors (2776359147).
1102214423353 is an equidigital number, since it uses as much as digits as its factorization.
1102214423353 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2776359146.
The product of its (nonzero) digits is 17280, while the sum is 31.
Adding to 1102214423353 its reverse (3533244122011), we get a palindrome (4635458545364).
The spelling of 1102214423353 in words is "one trillion, one hundred two billion, two hundred fourteen million, four hundred twenty-three thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •