Base | Representation |
---|---|
bin | 11011100101001100001110… |
… | …111101010101011000101100 |
3 | 120220111110021111022012101120 |
4 | 123211030032331111120230 |
5 | 111344412032122102312 |
6 | 1105553500132340540 |
7 | 34356565504041342 |
oct | 3345141675253054 |
9 | 526443244265346 |
10 | 121303012300332 |
11 | 35718356098205 |
12 | 11731405474750 |
13 | 528ba95624235 |
14 | 21d5150703992 |
15 | e05582c4e28c |
hex | 6e530ef5562c |
121303012300332 has 48 divisors (see below), whose sum is σ = 283951807003872. Its totient is φ = 40304147699200.
The previous prime is 121303012300307. The next prime is 121303012300339. The reversal of 121303012300332 is 233003210303121.
It is not an unprimeable number, because it can be changed into a prime (121303012300339) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 57550138 + ... + 59620670.
It is an arithmetic number, because the mean of its divisors is an integer number (5915662645914).
Almost surely, 2121303012300332 is an apocalyptic number.
121303012300332 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
121303012300332 is an abundant number, since it is smaller than the sum of its proper divisors (162648794703540).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121303012300332 is a wasteful number, since it uses less digits than its factorization.
121303012300332 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2086258 (or 2086256 counting only the distinct ones).
The product of its (nonzero) digits is 1944, while the sum is 24.
Adding to 121303012300332 its reverse (233003210303121), we get a palindrome (354306222603453).
The spelling of 121303012300332 in words is "one hundred twenty-one trillion, three hundred three billion, twelve million, three hundred thousand, three hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •