Base | Representation |
---|---|
bin | 11101101101111111000… |
… | …00001000010011010101 |
3 | 10121121200121122200112111 |
4 | 32312333200020103111 |
5 | 113212223222320041 |
6 | 2101032431551021 |
7 | 133526210544661 |
oct | 16667740102325 |
9 | 3547617580474 |
10 | 1021120120021 |
11 | 364066761741 |
12 | 145a9708b471 |
13 | 753a2a4a091 |
14 | 375cb3c78a1 |
15 | 1b8659de981 |
hex | edbf8084d5 |
1021120120021 has 16 divisors (see below), whose sum is σ = 1115640857520. Its totient is φ = 930769899520.
The previous prime is 1021120119989. The next prime is 1021120120169. The reversal of 1021120120021 is 1200210211201.
It can be written as a sum of positive squares in 8 ways, for example, as 24139836900 + 996980283121 = 155370^2 + 998489^2 .
It is not a de Polignac number, because 1021120120021 - 25 = 1021120119989 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1021120119983 and 1021120120010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1021120124021) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5251306 + ... + 5442283.
It is an arithmetic number, because the mean of its divisors is an integer number (69727553595).
Almost surely, 21021120120021 is an apocalyptic number.
It is an amenable number.
1021120120021 is a deficient number, since it is larger than the sum of its proper divisors (94520737499).
1021120120021 is a wasteful number, since it uses less digits than its factorization.
1021120120021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10693784.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 1021120120021 its reverse (1200210211201), we get a palindrome (2221330331222).
The spelling of 1021120120021 in words is "one trillion, twenty-one billion, one hundred twenty million, one hundred twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •