Base | Representation |
---|---|
bin | 11011100100001001010001… |
… | …110110000110000111000000 |
3 | 120220020120201012022120121210 |
4 | 123210021101312012013000 |
5 | 111342222313212012232 |
6 | 1105500450243450120 |
7 | 34351442111614062 |
oct | 3344112166060700 |
9 | 526216635276553 |
10 | 121231120032192 |
11 | 3569a913851075 |
12 | 1171b4a0986940 |
13 | 52850791523c1 |
14 | 21d1890677732 |
15 | e0377645b5cc |
hex | 6e4251d861c0 |
121231120032192 has 56 divisors (see below), whose sum is σ = 324817557932800. Its totient is φ = 39898849625856.
The previous prime is 121231120032181. The next prime is 121231120032221. The reversal of 121231120032192 is 291230021132121.
It is a super-3 number, since 3×1212311200321923 (a number of 43 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
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 7 ways as a sum of consecutive naturals, for example, 3996263842 + ... + 3996294177.
Almost surely, 2121231120032192 is an apocalyptic number.
121231120032192 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
121231120032192 is an abundant number, since it is smaller than the sum of its proper divisors (203586437900608).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121231120032192 is an equidigital number, since it uses as much as digits as its factorization.
121231120032192 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7992558113 (or 7992558103 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 30.
The spelling of 121231120032192 in words is "one hundred twenty-one trillion, two hundred thirty-one billion, one hundred twenty million, thirty-two thousand, one hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •