Base | Representation |
---|---|
bin | 111000010111000110… |
… | …1010111101101010000 |
3 | 102120102002110120212210 |
4 | 1300232031113231100 |
5 | 3440334242404300 |
6 | 131334041552120 |
7 | 11513225632263 |
oct | 1605615275520 |
9 | 376362416783 |
10 | 121034341200 |
11 | 4736a803a63 |
12 | 1b55a1a5640 |
13 | b54b589496 |
14 | 5c02872cda |
15 | 3235bbc050 |
hex | 1c2e357b50 |
121034341200 has 120 divisors (see below), whose sum is σ = 391270765600. Its totient is φ = 31979681280.
The previous prime is 121034341199. The next prime is 121034341213. The reversal of 121034341200 is 2143430121.
121034341200 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (120).
It is a congruent number.
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 331870 + ... + 593469.
Almost surely, 2121034341200 is an apocalyptic number.
121034341200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
121034341200 is an abundant number, since it is smaller than the sum of its proper divisors (270236424400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121034341200 is a wasteful number, since it uses less digits than its factorization.
121034341200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 925469 (or 925458 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 121034341200 its reverse (2143430121), we get a palindrome (123177771321).
The spelling of 121034341200 in words is "one hundred twenty-one billion, thirty-four million, three hundred forty-one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •