Base | Representation |
---|---|
bin | 111000100101000111… |
… | …0111011010001000001 |
3 | 102121121212011200122121 |
4 | 1301022032323101001 |
5 | 3442320123323131 |
6 | 131452435204241 |
7 | 11530665205654 |
oct | 1611216732101 |
9 | 377555150577 |
10 | 121504511041 |
11 | 47591146581 |
12 | 1b66b746681 |
13 | b5c4ac89a4 |
14 | 5c490a189b |
15 | 32620e1911 |
hex | 1c4a3bb441 |
121504511041 has 8 divisors (see below), whose sum is σ = 122700427200. Its totient is φ = 120308907792.
The previous prime is 121504511039. The next prime is 121504511059. The reversal of 121504511041 is 140115405121.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 121504511041 - 21 = 121504511039 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 121504510997 and 121504511015.
It is not an unprimeable number, because it can be changed into a prime (121504511081) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 744546 + ... + 892948.
It is an arithmetic number, because the mean of its divisors is an integer number (15337553400).
Almost surely, 2121504511041 is an apocalyptic number.
It is an amenable number.
121504511041 is a deficient number, since it is larger than the sum of its proper divisors (1195916159).
121504511041 is a wasteful number, since it uses less digits than its factorization.
121504511041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 156455.
The product of its (nonzero) digits is 800, while the sum is 25.
Adding to 121504511041 its reverse (140115405121), we get a palindrome (261619916162).
The spelling of 121504511041 in words is "one hundred twenty-one billion, five hundred four million, five hundred eleven thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •