Base | Representation |
---|---|
bin | 1011001000101001000111… |
… | …0011100010101011010101 |
3 | 1121100102120220021010100110 |
4 | 2302022101303202223111 |
5 | 3101042333332020201 |
6 | 42012223123033233 |
7 | 2402351335305234 |
oct | 262122163425325 |
9 | 47312526233313 |
10 | 12243103001301 |
11 | 39a02a8515927 |
12 | 145896650b819 |
13 | 6aa69a8ca453 |
14 | 3047d8406b1b |
15 | 1637104b96d6 |
hex | b2291ce2ad5 |
12243103001301 has 8 divisors (see below), whose sum is σ = 16371180959904. Its totient is φ = 8138546855120.
The previous prime is 12243103001237. The next prime is 12243103001321. The reversal of 12243103001301 is 10310030134221.
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 12243103001301 - 26 = 12243103001237 is a prime.
It is a super-2 number, since 2×122431030013012 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12243103001321) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5880451890 + ... + 5880453971.
It is an arithmetic number, because the mean of its divisors is an integer number (2046397619988).
Almost surely, 212243103001301 is an apocalyptic number.
It is an amenable number.
12243103001301 is a deficient number, since it is larger than the sum of its proper divisors (4128077958603).
12243103001301 is a wasteful number, since it uses less digits than its factorization.
12243103001301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11760906211.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 12243103001301 its reverse (10310030134221), we get a palindrome (22553133135522).
The spelling of 12243103001301 in words is "twelve trillion, two hundred forty-three billion, one hundred three million, one thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •