Base | Representation |
---|---|
bin | 11011100101011111001000… |
… | …010000111101101001010001 |
3 | 120220120101122110021000110111 |
4 | 123211133020100331221101 |
5 | 111400230110040200423 |
6 | 1110011053300001321 |
7 | 34361214334016200 |
oct | 3345371020755121 |
9 | 526511573230414 |
10 | 121323301100113 |
11 | 35725a17640832 |
12 | 11735328090241 |
13 | 5290979aa79c8 |
14 | 21d61170c5237 |
15 | e05d6e01560d |
hex | 6e57c843da51 |
121323301100113 has 24 divisors (see below), whose sum is σ = 141454813117824. Its totient is φ = 103753177113600.
The previous prime is 121323301100087. The next prime is 121323301100143. The reversal of 121323301100113 is 311001103323121.
It is not a de Polignac number, because 121323301100113 - 225 = 121323267545681 is a prime.
It is a super-2 number, since 2×1213233011001132 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (121323301100143) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 41523268 + ... + 44348938.
It is an arithmetic number, because the mean of its divisors is an integer number (5893950546576).
Almost surely, 2121323301100113 is an apocalyptic number.
It is an amenable number.
121323301100113 is a deficient number, since it is larger than the sum of its proper divisors (20131512017711).
121323301100113 is a wasteful number, since it uses less digits than its factorization.
121323301100113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2827693 (or 2827686 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 22.
Adding to 121323301100113 its reverse (311001103323121), we get a palindrome (432324404423234).
The spelling of 121323301100113 in words is "one hundred twenty-one trillion, three hundred twenty-three billion, three hundred one million, one hundred thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •