Base | Representation |
---|---|
bin | 111000010110011010… |
… | …1001010111010110100 |
3 | 102120100110221220202112 |
4 | 1300230311022322310 |
5 | 3440312333021043 |
6 | 131331454230152 |
7 | 11512525254050 |
oct | 1605465127264 |
9 | 376313856675 |
10 | 121011220148 |
11 | 47358751855 |
12 | 1b5524b5358 |
13 | b5468525a0 |
14 | 5bdd774c60 |
15 | 3233b51518 |
hex | 1c2cd4aeb4 |
121011220148 has 24 divisors (see below), whose sum is σ = 260639551872. Its totient is φ = 47872570464.
The previous prime is 121011220147. The next prime is 121011220151. The reversal of 121011220148 is 841022110121.
It is a happy number.
It is a super-2 number, since 2×1210112201482 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121011220147) 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, 166223840 + ... + 166224567.
It is an arithmetic number, because the mean of its divisors is an integer number (10859981328).
Almost surely, 2121011220148 is an apocalyptic number.
It is an amenable number.
121011220148 is an abundant number, since it is smaller than the sum of its proper divisors (139628331724).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121011220148 is a wasteful number, since it uses less digits than its factorization.
121011220148 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 332448431 (or 332448429 counting only the distinct ones).
The product of its (nonzero) digits is 256, while the sum is 23.
Adding to 121011220148 its reverse (841022110121), we get a palindrome (962033330269).
The spelling of 121011220148 in words is "one hundred twenty-one billion, eleven million, two hundred twenty thousand, one hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.026 sec. • engine limits •