Base | Representation |
---|---|
bin | 111000100101111010… |
… | …0011111010010010001 |
3 | 102121200201021100000122 |
4 | 1301023310133102101 |
5 | 3442343432310441 |
6 | 131455230000025 |
7 | 11531440414124 |
oct | 1611364372221 |
9 | 377621240018 |
10 | 121531135121 |
11 | 475a5180650 |
12 | 1b678646015 |
13 | b5ca48b196 |
14 | 5c4c8323bb |
15 | 326460034b |
hex | 1c4bd1f491 |
121531135121 has 16 divisors (see below), whose sum is σ = 134281359360. Its totient is φ = 109065063120.
The previous prime is 121531135111. The next prime is 121531135147.
It is a happy number.
121531135121 is nontrivially palindromic in base 10.
It is a cyclic number.
It is not a de Polignac number, because 121531135121 - 222 = 121526940817 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (121531135111) 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, 7624466 + ... + 7640388.
It is an arithmetic number, because the mean of its divisors is an integer number (8392584960).
Almost surely, 2121531135121 is an apocalyptic number.
121531135121 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
121531135121 is a deficient number, since it is larger than the sum of its proper divisors (12750224239).
121531135121 is a wasteful number, since it uses less digits than its factorization.
121531135121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24796.
The product of its digits is 900, while the sum is 26.
It can be divided in two parts, 121531 and 135121, that added together give a palindrome (256652).
The spelling of 121531135121 in words is "one hundred twenty-one billion, five hundred thirty-one million, one hundred thirty-five thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •