Base | Representation |
---|---|
bin | 111000011111000011… |
… | …1000011011111111111 |
3 | 102121002200110101222222 |
4 | 1300332013003133333 |
5 | 3441411041333043 |
6 | 131420331555555 |
7 | 11522645342105 |
oct | 1607607033777 |
9 | 377080411888 |
10 | 121301121023 |
11 | 47497358655 |
12 | 1b6135bbbbb |
13 | b591925674 |
14 | 5c2a079c75 |
15 | 324e317d68 |
hex | 1c3e1c37ff |
121301121023 has 8 divisors (see below), whose sum is σ = 121423599360. Its totient is φ = 121178686680.
The previous prime is 121301121017. The next prime is 121301121077. The reversal of 121301121023 is 320121103121.
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 121301121023 - 28 = 121301120767 is a prime.
It is a super-2 number, since 2×1213011210232 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 121301120992 and 121301121010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121301121083) 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, 8840138 + ... + 8853848.
It is an arithmetic number, because the mean of its divisors is an integer number (15177949920).
Almost surely, 2121301121023 is an apocalyptic number.
121301121023 is a deficient number, since it is larger than the sum of its proper divisors (122478337).
121301121023 is a wasteful number, since it uses less digits than its factorization.
121301121023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 21997.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 121301121023 its reverse (320121103121), we get a palindrome (441422224144).
The spelling of 121301121023 in words is "one hundred twenty-one billion, three hundred one million, one hundred twenty-one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •