Base | Representation |
---|---|
bin | 100000110110000… |
… | …0010110101100001 |
3 | 2211210201200221222 |
4 | 1001230002311201 |
5 | 4224112034433 |
6 | 301205024425 |
7 | 36211253321 |
oct | 10154026541 |
9 | 2753650858 |
10 | 1102064993 |
11 | 5160a5817 |
12 | 2690b5115 |
13 | 147424883 |
14 | a6519281 |
15 | 66b42b98 |
hex | 41b02d61 |
1102064993 has 4 divisors (see below), whose sum is σ = 1102151088. Its totient is φ = 1101978900.
The previous prime is 1102064963. The next prime is 1102065007. The reversal of 1102064993 is 3994602011.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also a brilliant number, because the two primes have the same length, and also an emirpimes, since its reverse is a distinct semiprime: 3994602011 = 27211 ⋅146801.
It is a cyclic number.
It is not a de Polignac number, because 1102064993 - 28 = 1102064737 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (1102064963) 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, 19583 + ... + 50868.
It is an arithmetic number, because the mean of its divisors is an integer number (275537772).
Almost surely, 21102064993 is an apocalyptic number.
It is an amenable number.
1102064993 is a deficient number, since it is larger than the sum of its proper divisors (86095).
1102064993 is an equidigital number, since it uses as much as digits as its factorization.
1102064993 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 86094.
The product of its (nonzero) digits is 11664, while the sum is 35.
The square root of 1102064993 is about 33197.3642477833. The cubic root of 1102064993 is about 1032.9256665805.
The spelling of 1102064993 in words is "one billion, one hundred two million, sixty-four thousand, nine hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •