Base | Representation |
---|---|
bin | 11011100101001010011000… |
… | …011001010000011001010111 |
3 | 120220111021010212022221100121 |
4 | 123211022120121100121113 |
5 | 111344343443410144343 |
6 | 1105552530513452411 |
7 | 34356465301266445 |
oct | 3345123031203127 |
9 | 526437125287317 |
10 | 121301023131223 |
11 | 35717525278aa1 |
12 | 11730b4b271107 |
13 | 528b83949c9b0 |
14 | 21d5002467b95 |
15 | e054b82caaed |
hex | 6e5298650657 |
121301023131223 has 16 divisors (see below), whose sum is σ = 132846672752640. Its totient is φ = 110071793814624.
The previous prime is 121301023131217. The next prime is 121301023131259. The reversal of 121301023131223 is 322131320103121.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-121301023131223 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121301723131223) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 221652790 + ... + 222199372.
It is an arithmetic number, because the mean of its divisors is an integer number (8302917047040).
Almost surely, 2121301023131223 is an apocalyptic number.
121301023131223 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
121301023131223 is a deficient number, since it is larger than the sum of its proper divisors (11545649621417).
121301023131223 is a wasteful number, since it uses less digits than its factorization.
121301023131223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 835998.
The product of its (nonzero) digits is 1296, while the sum is 25.
Adding to 121301023131223 its reverse (322131320103121), we get a palindrome (443432343234344).
The spelling of 121301023131223 in words is "one hundred twenty-one trillion, three hundred one billion, twenty-three million, one hundred thirty-one thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •