Base | Representation |
---|---|
bin | 111000010110000111… |
… | …1000001101110100111 |
3 | 102120022210010220112212 |
4 | 1300230033001232213 |
5 | 3440302303033111 |
6 | 131330500034035 |
7 | 11512344260105 |
oct | 1605417015647 |
9 | 376283126485 |
10 | 121001221031 |
11 | 47353042319 |
12 | 1b54b09291b |
13 | b544761252 |
14 | 5bdc2d0c75 |
15 | 3232d2898b |
hex | 1c2c3c1ba7 |
121001221031 has 16 divisors (see below), whose sum is σ = 122547409920. Its totient is φ = 119463543360.
The previous prime is 121001221021. The next prime is 121001221037. The reversal of 121001221031 is 130122100121.
It is a cyclic number.
It is not a de Polignac number, because 121001221031 - 230 = 119927479207 is a prime.
It is a super-2 number, since 2×1210012210312 (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 = 121001220997 and 121001221015.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121001221037) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 47996051 + ... + 47998571.
It is an arithmetic number, because the mean of its divisors is an integer number (7659213120).
Almost surely, 2121001221031 is an apocalyptic number.
121001221031 is a deficient number, since it is larger than the sum of its proper divisors (1546188889).
121001221031 is a wasteful number, since it uses less digits than its factorization.
121001221031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3974.
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 121001221031 its reverse (130122100121), we get a palindrome (251123321152).
The spelling of 121001221031 in words is "one hundred twenty-one billion, one million, two hundred twenty-one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •