Base | Representation |
---|---|
bin | 1001100110011001111110… |
… | …1101010101111110101001 |
3 | 1101101002100221212102112211 |
4 | 2121212133231111332221 |
5 | 2340414442003010441 |
6 | 34241031301005121 |
7 | 2136414000364216 |
oct | 231463755257651 |
9 | 41332327772484 |
10 | 10555414110121 |
11 | 33aa5870a4641 |
12 | 12258629b37a1 |
13 | 5b74a991676a |
14 | 286c55b3cb0d |
15 | 1348858c1a81 |
hex | 9999fb55fa9 |
10555414110121 has 8 divisors (see below), whose sum is σ = 11369356692320. Its totient is φ = 9767310975072.
The previous prime is 10555414110119. The next prime is 10555414110151. The reversal of 10555414110121 is 12101141455501.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10555414110121 - 21 = 10555414110119 is a prime.
It is a super-2 number, since 2×105554141101212 (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 (10555414110151) 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, 6459860940 + ... + 6459862573.
It is an arithmetic number, because the mean of its divisors is an integer number (1421169586540).
Almost surely, 210555414110121 is an apocalyptic number.
It is an amenable number.
10555414110121 is a deficient number, since it is larger than the sum of its proper divisors (813942582199).
10555414110121 is a wasteful number, since it uses less digits than its factorization.
10555414110121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12919723575.
The product of its (nonzero) digits is 4000, while the sum is 31.
Adding to 10555414110121 its reverse (12101141455501), we get a palindrome (22656555565622).
The spelling of 10555414110121 in words is "ten trillion, five hundred fifty-five billion, four hundred fourteen million, one hundred ten thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •