Base | Representation |
---|---|
bin | 10111001100011111011010… |
… | …111011010001111000011001 |
3 | 111101012101112010012002221020 |
4 | 113030133122323101320121 |
5 | 101332342011423020441 |
6 | 1000544154455433053 |
7 | 30326141113136064 |
oct | 2714373273217031 |
9 | 441171463162836 |
10 | 102013441220121 |
11 | 2a5607260a1642 |
12 | b536a7b085789 |
13 | 44bca982c35b2 |
14 | 1b296968818db |
15 | bbd90c805e66 |
hex | 5cc7daed1e19 |
102013441220121 has 8 divisors (see below), whose sum is σ = 140405596518144. Its totient is φ = 65815123367760.
The previous prime is 102013441220101. The next prime is 102013441220123. The reversal of 102013441220121 is 121022144310201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 102013441220121 - 26 = 102013441220057 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 102013441220091 and 102013441220100.
It is not an unprimeable number, because it can be changed into a prime (102013441220123) 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, 548459361306 + ... + 548459361491.
It is an arithmetic number, because the mean of its divisors is an integer number (17550699564768).
Almost surely, 2102013441220121 is an apocalyptic number.
It is an amenable number.
102013441220121 is a deficient number, since it is larger than the sum of its proper divisors (38392155298023).
102013441220121 is a wasteful number, since it uses less digits than its factorization.
102013441220121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1096918722831.
The product of its (nonzero) digits is 768, while the sum is 24.
Adding to 102013441220121 its reverse (121022144310201), we get a palindrome (223035585530322).
The spelling of 102013441220121 in words is "one hundred two trillion, thirteen billion, four hundred forty-one million, two hundred twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •