Base | Representation |
---|---|
bin | 10000000010011010011… |
… | …010010111011111100101 |
3 | 10220100201101210011112122 |
4 | 100002122122113133211 |
5 | 121024101132343023 |
6 | 2202144311355325 |
7 | 142424056252640 |
oct | 20023232273745 |
9 | 3810641704478 |
10 | 1102102231013 |
11 | 395442a832a3 |
12 | 159717982b45 |
13 | 7cc0a497754 |
14 | 3b4b0774a57 |
15 | 1da053092c8 |
hex | 1009a6977e5 |
1102102231013 has 8 divisors (see below), whose sum is σ = 1259598077760. Its totient is φ = 944619552000.
The previous prime is 1102102230967. The next prime is 1102102231067. The reversal of 1102102231013 is 3101322012011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1102102231013 - 212 = 1102102226917 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1102102230982 and 1102102231000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1102102231313) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3111923 + ... + 3447936.
It is an arithmetic number, because the mean of its divisors is an integer number (157449759720).
Almost surely, 21102102231013 is an apocalyptic number.
It is an amenable number.
1102102231013 is a deficient number, since it is larger than the sum of its proper divisors (157495846747).
1102102231013 is an equidigital number, since it uses as much as digits as its factorization.
1102102231013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6583867.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 1102102231013 its reverse (3101322012011), we get a palindrome (4203424243024).
The spelling of 1102102231013 in words is "one trillion, one hundred two billion, one hundred two million, two hundred thirty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •