Base | Representation |
---|---|
bin | 11011100001010001101101… |
… | …110010101101100000110100 |
3 | 120212112201221222121102111011 |
4 | 123201101231302231200310 |
5 | 111331010133211131234 |
6 | 1105230132242522004 |
7 | 34331263566520210 |
oct | 3341215562554064 |
9 | 525481858542434 |
10 | 121034020411444 |
11 | 35624270198818 |
12 | 116a9254666304 |
13 | 526c5c79a778a |
14 | 21c6113869940 |
15 | ded58c94db64 |
hex | 6e146dcad834 |
121034020411444 has 24 divisors (see below), whose sum is σ = 242068561273280. Its totient is φ = 51871611508416.
The previous prime is 121034020411441. The next prime is 121034020411459. The reversal of 121034020411444 is 444114020430121.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121034020411441) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9348304 + ... + 18151000.
Almost surely, 2121034020411444 is an apocalyptic number.
121034020411444 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
121034020411444 is an abundant number, since it is smaller than the sum of its proper divisors (121034540861836).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121034020411444 is a wasteful number, since it uses less digits than its factorization.
121034020411444 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9293767 (or 9293765 counting only the distinct ones).
The product of its (nonzero) digits is 12288, while the sum is 31.
Adding to 121034020411444 its reverse (444114020430121), we get a palindrome (565148040841565).
The spelling of 121034020411444 in words is "one hundred twenty-one trillion, thirty-four billion, twenty million, four hundred eleven thousand, four hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •