Base | Representation |
---|---|
bin | 10111001011000110… |
… | …00101001011010101 |
3 | 1012010001011001001010 |
4 | 23211203011023111 |
5 | 200434411111201 |
6 | 5414304122433 |
7 | 620205501231 |
oct | 134543051325 |
9 | 35101131033 |
10 | 12441113301 |
11 | 5304758621 |
12 | 24b2606419 |
13 | 123366c606 |
14 | 8604455c1 |
15 | 4cc355bd6 |
hex | 2e58c52d5 |
12441113301 has 8 divisors (see below), whose sum is σ = 16593408160. Its totient is φ = 8291446992.
The previous prime is 12441113263. The next prime is 12441113317. The reversal of 12441113301 is 10331114421.
12441113301 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 12441113301 - 27 = 12441113173 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 (12441113351) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 646066 + ... + 665043.
It is an arithmetic number, because the mean of its divisors is an integer number (2074176020).
Almost surely, 212441113301 is an apocalyptic number.
It is an amenable number.
12441113301 is a deficient number, since it is larger than the sum of its proper divisors (4152294859).
12441113301 is a wasteful number, since it uses less digits than its factorization.
12441113301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1314275.
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 12441113301 its reverse (10331114421), we get a palindrome (22772227722).
The spelling of 12441113301 in words is "twelve billion, four hundred forty-one million, one hundred thirteen thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •