Base | Representation |
---|---|
bin | 111000011111000101… |
… | …1001011101110111011 |
3 | 102121002202111101122011 |
4 | 1300332023023232323 |
5 | 3441411331001243 |
6 | 131420411110351 |
7 | 11522660500360 |
oct | 1607613135673 |
9 | 377082441564 |
10 | 121302203323 |
11 | 47497a27814 |
12 | 1b613a423b7 |
13 | b591c14192 |
14 | 5c2a27c467 |
15 | 324e47d89d |
hex | 1c3e2cbbbb |
121302203323 has 8 divisors (see below), whose sum is σ = 138717692640. Its totient is φ = 103908364800.
The previous prime is 121302203317. The next prime is 121302203369. The reversal of 121302203323 is 323302203121.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-121302203323 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 121302203294 and 121302203303.
It is not an unprimeable number, because it can be changed into a prime (121302203423) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5400688 + ... + 5423101.
It is an arithmetic number, because the mean of its divisors is an integer number (17339711580).
Almost surely, 2121302203323 is an apocalyptic number.
121302203323 is a deficient number, since it is larger than the sum of its proper divisors (17415489317).
121302203323 is a wasteful number, since it uses less digits than its factorization.
121302203323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10825397.
The product of its (nonzero) digits is 1296, while the sum is 22.
Adding to 121302203323 its reverse (323302203121), we get a palindrome (444604406444).
The spelling of 121302203323 in words is "one hundred twenty-one billion, three hundred two million, two hundred three thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •