Base | Representation |
---|---|
bin | 111000100100001101… |
… | …0100111001010110100 |
3 | 102121112201210120211112 |
4 | 1301020122213022310 |
5 | 3442234322120040 |
6 | 131445425454152 |
7 | 11530145063603 |
oct | 1611032471264 |
9 | 377481716745 |
10 | 121474020020 |
11 | 47575a10191 |
12 | 1b6614a1358 |
13 | b5bb6b1372 |
14 | 5c45005a3a |
15 | 325e5bc365 |
hex | 1c486a72b4 |
121474020020 has 12 divisors (see below), whose sum is σ = 255095442084. Its totient is φ = 48589608000.
The previous prime is 121474020001. The next prime is 121474020043. The reversal of 121474020020 is 20020474121.
It can be written as a sum of positive squares in 2 ways, for example, as 28944897424 + 92529122596 = 170132^2 + 304186^2 .
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 3036850481 + ... + 3036850520.
It is an arithmetic number, because the mean of its divisors is an integer number (21257953507).
Almost surely, 2121474020020 is an apocalyptic number.
121474020020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
121474020020 is an abundant number, since it is smaller than the sum of its proper divisors (133621422064).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121474020020 is a wasteful number, since it uses less digits than its factorization.
121474020020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6073701010 (or 6073701008 counting only the distinct ones).
The product of its (nonzero) digits is 896, while the sum is 23.
Adding to 121474020020 its reverse (20020474121), we get a palindrome (141494494141).
The spelling of 121474020020 in words is "one hundred twenty-one billion, four hundred seventy-four million, twenty thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •