Base | Representation |
---|---|
bin | 111000011010100000… |
… | …1010101010010100001 |
3 | 102120201001111212021011 |
4 | 1300311001111102201 |
5 | 3441103022013311 |
6 | 131353243300521 |
7 | 11516114221330 |
oct | 1606501252241 |
9 | 376631455234 |
10 | 121148626081 |
11 | 4741927197a |
12 | 1b59051a741 |
13 | b569161c82 |
14 | 5c13b01d17 |
15 | 3240c44321 |
hex | 1c350554a1 |
121148626081 has 4 divisors (see below), whose sum is σ = 138455572672. Its totient is φ = 103841679492.
The previous prime is 121148626069. The next prime is 121148626129. The reversal of 121148626081 is 180626841121.
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: 180626841121 = 463 ⋅390122767.
It is a cyclic number.
It is not a de Polignac number, because 121148626081 - 27 = 121148625953 is a prime.
It is a super-2 number, since 2×1211486260812 (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 (121148626031) 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, 8653473285 + ... + 8653473298.
It is an arithmetic number, because the mean of its divisors is an integer number (34613893168).
Almost surely, 2121148626081 is an apocalyptic number.
It is an amenable number.
121148626081 is a deficient number, since it is larger than the sum of its proper divisors (17306946591).
121148626081 is an equidigital number, since it uses as much as digits as its factorization.
121148626081 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17306946590.
The product of its (nonzero) digits is 36864, while the sum is 40.
The spelling of 121148626081 in words is "one hundred twenty-one billion, one hundred forty-eight million, six hundred twenty-six thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •