Base | Representation |
---|---|
bin | 10000000010011010010… |
… | …110001000010001111001 |
3 | 10220100201022200201200111 |
4 | 100002122112020101321 |
5 | 121024100341320441 |
6 | 2202144231504321 |
7 | 142424043645121 |
oct | 20023226102171 |
9 | 3810638621614 |
10 | 1102101120121 |
11 | 395442394701 |
12 | 1597175280a1 |
13 | 7cc0a198c11 |
14 | 3b4b0565c81 |
15 | 1da0518a081 |
hex | 1009a588479 |
1102101120121 has 4 divisors (see below), whose sum is σ = 1122895480932. Its totient is φ = 1081306759312.
The previous prime is 1102101120103. The next prime is 1102101120151. The reversal of 1102101120121 is 1210211012011.
It is a happy number.
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 681963807721 + 420137312400 = 825811^2 + 648180^2 .
It is a cyclic number.
It is not a de Polignac number, because 1102101120121 - 25 = 1102101120089 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1102101120151) 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, 10397180326 + ... + 10397180431.
It is an arithmetic number, because the mean of its divisors is an integer number (280723870233).
Almost surely, 21102101120121 is an apocalyptic number.
It is an amenable number.
1102101120121 is a deficient number, since it is larger than the sum of its proper divisors (20794360811).
1102101120121 is an equidigital number, since it uses as much as digits as its factorization.
1102101120121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20794360810.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 1102101120121 its reverse (1210211012011), we get a palindrome (2312312132132).
The spelling of 1102101120121 in words is "one trillion, one hundred two billion, one hundred one million, one hundred twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •