Base | Representation |
---|---|
bin | 111000100011100111… |
… | …0101011001001001011 |
3 | 102121111100100020000122 |
4 | 1301013032223021023 |
5 | 3442214223111410 |
6 | 131443435053455 |
7 | 11526513633641 |
oct | 1610716531113 |
9 | 377440306018 |
10 | 121454113355 |
11 | 47565753aa3 |
12 | 1b6568a128b |
13 | b5b7531583 |
14 | 5c42503191 |
15 | 325c988e55 |
hex | 1c473ab24b |
121454113355 has 8 divisors (see below), whose sum is σ = 145748311632. Its totient is φ = 97161040288.
The previous prime is 121454113349. The next prime is 121454113357. The reversal of 121454113355 is 553311454121.
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 121454113355 - 234 = 104274244171 is a prime.
It is a super-2 number, since 2×1214541133552 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (121454113357) 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 7 ways as a sum of consecutive naturals, for example, 22124 + ... + 493353.
It is an arithmetic number, because the mean of its divisors is an integer number (18218538954).
Almost surely, 2121454113355 is an apocalyptic number.
121454113355 is a deficient number, since it is larger than the sum of its proper divisors (24294198277).
121454113355 is an equidigital number, since it uses as much as digits as its factorization.
121454113355 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 562605.
The product of its digits is 36000, while the sum is 35.
Adding to 121454113355 its reverse (553311454121), we get a palindrome (674765567476).
The spelling of 121454113355 in words is "one hundred twenty-one billion, four hundred fifty-four million, one hundred thirteen thousand, three hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.059 sec. • engine limits •