Base | Representation |
---|---|
bin | 111000100011101000… |
… | …0010001010111011101 |
3 | 102121111101010111101021 |
4 | 1301013100101113131 |
5 | 3442214330011221 |
6 | 131443452044141 |
7 | 11526520326442 |
oct | 1610720212735 |
9 | 377441114337 |
10 | 121454532061 |
11 | 47565a0a635 |
12 | 1b656a63651 |
13 | b5b764a025 |
14 | 5c425b19c9 |
15 | 325ca1d041 |
hex | 1c474115dd |
121454532061 has 4 divisors (see below), whose sum is σ = 125372420224. Its totient is φ = 117536643900.
The previous prime is 121454532053. The next prime is 121454532079. The reversal of 121454532061 is 160235454121.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 160235454121 = 347 ⋅461773643.
It is a cyclic number.
It is not a de Polignac number, because 121454532061 - 23 = 121454532053 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 (121454532461) 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, 1958944035 + ... + 1958944096.
It is an arithmetic number, because the mean of its divisors is an integer number (31343105056).
Almost surely, 2121454532061 is an apocalyptic number.
It is an amenable number.
121454532061 is a deficient number, since it is larger than the sum of its proper divisors (3917888163).
121454532061 is an equidigital number, since it uses as much as digits as its factorization.
121454532061 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3917888162.
The product of its (nonzero) digits is 28800, while the sum is 34.
Adding to 121454532061 its reverse (160235454121), we get a palindrome (281689986182).
The spelling of 121454532061 in words is "one hundred twenty-one billion, four hundred fifty-four million, five hundred thirty-two thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •