Base | Representation |
---|---|
bin | 1001001101000111101101… |
… | …0001001000111110001101 |
3 | 1022211120002122212000122222 |
4 | 2103101323101020332031 |
5 | 2311310312311241031 |
6 | 33305310035345125 |
7 | 2063135042251511 |
oct | 223217321107615 |
9 | 38746078760588 |
10 | 10121011040141 |
11 | 3252329972601 |
12 | 117562a1521a5 |
13 | 58553a946ba1 |
14 | 26dc06858141 |
15 | 12840da5ae7b |
hex | 9347b448f8d |
10121011040141 has 8 divisors (see below), whose sum is σ = 10562015096640. Its totient is φ = 9680086991872.
The previous prime is 10121011040117. The next prime is 10121011040167. The reversal of 10121011040141 is 14104011012101.
10121011040141 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 10121011040141 - 222 = 10121006845837 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10121011040111) 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, 19743476 + ... + 20249613.
It is an arithmetic number, because the mean of its divisors is an integer number (1320251887080).
Almost surely, 210121011040141 is an apocalyptic number.
It is an amenable number.
10121011040141 is a deficient number, since it is larger than the sum of its proper divisors (441004056499).
10121011040141 is a wasteful number, since it uses less digits than its factorization.
10121011040141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 40004115.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 10121011040141 its reverse (14104011012101), we get a palindrome (24225022052242).
The spelling of 10121011040141 in words is "ten trillion, one hundred twenty-one billion, eleven million, forty thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •