Base | Representation |
---|---|
bin | 111000100011000001… |
… | …0000010101001011101 |
3 | 102121102221112121100111 |
4 | 1301012002002221131 |
5 | 3442144102241131 |
6 | 131441440330021 |
7 | 11526151114654 |
oct | 1610602025135 |
9 | 377387477314 |
10 | 121434024541 |
11 | 47555382a75 |
12 | 1b650013911 |
13 | b5b33198bb |
14 | 5c3d99419b |
15 | 325ad1bab1 |
hex | 1c46082a5d |
121434024541 has 4 divisors (see below), whose sum is σ = 122063216572. Its totient is φ = 120804832512.
The previous prime is 121434024539. The next prime is 121434024563. The reversal of 121434024541 is 145420434121.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 27029004025 + 94405020516 = 164405^2 + 307254^2 .
It is a cyclic number.
It is not a de Polignac number, because 121434024541 - 21 = 121434024539 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 (121434024511) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 314595726 + ... + 314596111.
It is an arithmetic number, because the mean of its divisors is an integer number (30515804143).
Almost surely, 2121434024541 is an apocalyptic number.
It is an amenable number.
121434024541 is a deficient number, since it is larger than the sum of its proper divisors (629192031).
121434024541 is an equidigital number, since it uses as much as digits as its factorization.
121434024541 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 629192030.
The product of its (nonzero) digits is 15360, while the sum is 31.
Adding to 121434024541 its reverse (145420434121), we get a palindrome (266854458662).
The spelling of 121434024541 in words is "one hundred twenty-one billion, four hundred thirty-four million, twenty-four thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •