Base | Representation |
---|---|
bin | 111000011100101010… |
… | …1011101111011101111 |
3 | 102120220002201111202201 |
4 | 1300321111131323233 |
5 | 3441230034410411 |
6 | 131404351002331 |
7 | 11520653416513 |
oct | 1607125357357 |
9 | 376802644681 |
10 | 121221013231 |
11 | 4745611346a |
12 | 1b5b08093a7 |
13 | b57b1581c6 |
14 | 5c1d586143 |
15 | 32472923c1 |
hex | 1c3955deef |
121221013231 has 8 divisors (see below), whose sum is σ = 125498372400. Its totient is φ = 116950142400.
The previous prime is 121221013189. The next prime is 121221013241. The reversal of 121221013231 is 132310122121.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-121221013231 is a prime.
It is a super-2 number, since 2×1212210132312 (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 = 121221013199 and 121221013208.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121221013241) 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, 1584045 + ... + 1658806.
It is an arithmetic number, because the mean of its divisors is an integer number (15687296550).
Almost surely, 2121221013231 is an apocalyptic number.
121221013231 is a deficient number, since it is larger than the sum of its proper divisors (4277359169).
121221013231 is a wasteful number, since it uses less digits than its factorization.
121221013231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3244169.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 121221013231 its reverse (132310122121), we get a palindrome (253531135352).
The spelling of 121221013231 in words is "one hundred twenty-one billion, two hundred twenty-one million, thirteen thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •