Base | Representation |
---|---|
bin | 111000100101000100… |
… | …1111110011100001011 |
3 | 102121121202201202111222 |
4 | 1301022021332130023 |
5 | 3442314310311243 |
6 | 131452351312255 |
7 | 11530651162352 |
oct | 1611211763413 |
9 | 377552652458 |
10 | 121503213323 |
11 | 4759043a588 |
12 | 1b66b21b68b |
13 | b5c47630cb |
14 | 5c48c44999 |
15 | 3261e37168 |
hex | 1c4a27e70b |
121503213323 has 8 divisors (see below), whose sum is σ = 123569248560. Its totient is φ = 119437400160.
The previous prime is 121503213319. The next prime is 121503213341. The reversal of 121503213323 is 323312305121.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 121503213323 - 22 = 121503213319 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 121503213292 and 121503213301.
It is not an unprimeable number, because it can be changed into a prime (121503213023) by changing a digit.
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, 1346153 + ... + 1433573.
It is an arithmetic number, because the mean of its divisors is an integer number (15446156070).
Almost surely, 2121503213323 is an apocalyptic number.
121503213323 is a deficient number, since it is larger than the sum of its proper divisors (2066035237).
121503213323 is an equidigital number, since it uses as much as digits as its factorization.
121503213323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 111037.
The product of its (nonzero) digits is 3240, while the sum is 26.
Adding to 121503213323 its reverse (323312305121), we get a palindrome (444815518444).
The spelling of 121503213323 in words is "one hundred twenty-one billion, five hundred three million, two hundred thirteen thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •