Base | Representation |
---|---|
bin | 111000011111111111… |
… | …0100101011001110111 |
3 | 102121011212102100011210 |
4 | 1300333332211121313 |
5 | 3441442102030111 |
6 | 131423411332503 |
7 | 11523505564644 |
oct | 1607776453167 |
9 | 377155370153 |
10 | 121332455031 |
11 | 4750300a327 |
12 | 1b621bb1133 |
13 | b5982768b8 |
14 | 5c302b4dcb |
15 | 3251e570a6 |
hex | 1c3ffa5677 |
121332455031 has 4 divisors (see below), whose sum is σ = 161776606712. Its totient is φ = 80888303352.
The previous prime is 121332455009. The next prime is 121332455087. The reversal of 121332455031 is 130554233121.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 121332455031 - 221 = 121330357879 is a prime.
It is a super-2 number, since 2×1213324550312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 121332455031.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121332405031) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 20222075836 + ... + 20222075841.
It is an arithmetic number, because the mean of its divisors is an integer number (40444151678).
Almost surely, 2121332455031 is an apocalyptic number.
121332455031 is a deficient number, since it is larger than the sum of its proper divisors (40444151681).
121332455031 is an equidigital number, since it uses as much as digits as its factorization.
121332455031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40444151680.
The product of its (nonzero) digits is 10800, while the sum is 30.
Adding to 121332455031 its reverse (130554233121), we get a palindrome (251886688152).
The spelling of 121332455031 in words is "one hundred twenty-one billion, three hundred thirty-two million, four hundred fifty-five thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •