Base | Representation |
---|---|
bin | 11011100010010001000011… |
… | …100011000001011010001111 |
3 | 120212210020111202210000101112 |
4 | 123202101003203001122033 |
5 | 111333113424432213203 |
6 | 1105321301032402235 |
7 | 34336222140226214 |
oct | 3342210343013217 |
9 | 525706452700345 |
10 | 121102031132303 |
11 | 356500a04a5a41 |
12 | 116ba47524637b |
13 | 5275b45c5c780 |
14 | 21c95261b7b0b |
15 | e0021d5b86d8 |
hex | 6e24438c168f |
121102031132303 has 32 divisors (see below), whose sum is σ = 131867182560960. Its totient is φ = 110551308134400.
The previous prime is 121102031132221. The next prime is 121102031132323. The reversal of 121102031132303 is 303231130201121.
It is a cyclic number.
It is not a de Polignac number, because 121102031132303 - 212 = 121102031128207 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121102031132323) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1117112903 + ... + 1117221303.
It is an arithmetic number, because the mean of its divisors is an integer number (4120849455030).
Almost surely, 2121102031132303 is an apocalyptic number.
121102031132303 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
121102031132303 is a deficient number, since it is larger than the sum of its proper divisors (10765151428657).
121102031132303 is a wasteful number, since it uses less digits than its factorization.
121102031132303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 111227.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 121102031132303 its reverse (303231130201121), we get a palindrome (424333161333424).
The spelling of 121102031132303 in words is "one hundred twenty-one trillion, one hundred two billion, thirty-one million, one hundred thirty-two thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •