Base | Representation |
---|---|
bin | 1001000111001111110100… |
… | …1101111000111101110001 |
3 | 1022110220122211112021110011 |
4 | 2101303331031320331301 |
5 | 2303132142133323441 |
6 | 33151101555134521 |
7 | 2052633500540242 |
oct | 221637515707561 |
9 | 38426584467404 |
10 | 10020112011121 |
11 | 3213562008713 |
12 | 1159b6b2a4441 |
13 | 578b7aac0a14 |
14 | 268d94250cc9 |
15 | 1259a5937581 |
hex | 91cfd378f71 |
10020112011121 has 8 divisors (see below), whose sum is σ = 10265552476704. Its totient is φ = 9774721426080.
The previous prime is 10020112011043. The next prime is 10020112011131. The reversal of 10020112011121 is 12111021102001.
It is a happy number.
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 10020112011121 - 215 = 10020111978353 is a prime.
It is a super-2 number, since 2×100201120111212 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10020112011131) 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, 12063291 + ... + 12867136.
It is an arithmetic number, because the mean of its divisors is an integer number (1283194059588).
Almost surely, 210020112011121 is an apocalyptic number.
It is an amenable number.
10020112011121 is a deficient number, since it is larger than the sum of its proper divisors (245440465583).
10020112011121 is an equidigital number, since it uses as much as digits as its factorization.
10020112011121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 24940271.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 10020112011121 its reverse (12111021102001), we get a palindrome (22131133113122).
The spelling of 10020112011121 in words is "ten trillion, twenty billion, one hundred twelve million, eleven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •