Base | Representation |
---|---|
bin | 10000000010010100111… |
… | …110011011001101011001 |
3 | 10220100111001011011201110 |
4 | 100002110332123031121 |
5 | 121023404310120441 |
6 | 2202131252410533 |
7 | 142421601054654 |
oct | 20022476331531 |
9 | 3810431134643 |
10 | 1102011020121 |
11 | 3953a65451a0 |
12 | 1596b1316a49 |
13 | 7cbc46105cb |
14 | 3b4a25d089b |
15 | 1d9ec2ddb16 |
hex | 10094f9b359 |
1102011020121 has 16 divisors (see below), whose sum is σ = 1633168992960. Its totient is φ = 655283853120.
The previous prime is 1102011020081. The next prime is 1102011020147. The reversal of 1102011020121 is 1210201102011.
It is not a de Polignac number, because 1102011020121 - 215 = 1102010987353 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1102011020097 and 1102011020106.
It is not an unprimeable number, because it can be changed into a prime (1102011020021) 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 15 ways as a sum of consecutive naturals, for example, 315038566 + ... + 315042063.
It is an arithmetic number, because the mean of its divisors is an integer number (102073062060).
Almost surely, 21102011020121 is an apocalyptic number.
1102011020121 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1102011020121 is a deficient number, since it is larger than the sum of its proper divisors (531157972839).
1102011020121 is a wasteful number, since it uses less digits than its factorization.
1102011020121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 630080696.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 1102011020121 its reverse (1210201102011), we get a palindrome (2312212122132).
The spelling of 1102011020121 in words is "one trillion, one hundred two billion, eleven million, twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •