Base | Representation |
---|---|
bin | 10000010110010010100… |
… | …000011001010101111001 |
3 | 10222101210202220012221102 |
4 | 100112102200121111321 |
5 | 121401303233231301 |
6 | 2220034145021145 |
7 | 144111000045002 |
oct | 20262240312571 |
9 | 3871722805842 |
10 | 1123444430201 |
11 | 3a34a5102445 |
12 | 1618933247b5 |
13 | 81c2bc63b92 |
14 | 3c5370041a9 |
15 | 1e353cedb6b |
hex | 10592819579 |
1123444430201 has 8 divisors (see below), whose sum is σ = 1149207091200. Its totient is φ = 1097759252128.
The previous prime is 1123444430191. The next prime is 1123444430321. The reversal of 1123444430201 is 1020344443211.
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 1123444430201 - 226 = 1123377321337 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1123444430701) 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, 19341401 + ... + 19399398.
It is an arithmetic number, because the mean of its divisors is an integer number (143650886400).
Almost surely, 21123444430201 is an apocalyptic number.
It is an amenable number.
1123444430201 is a deficient number, since it is larger than the sum of its proper divisors (25762660999).
1123444430201 is an equidigital number, since it uses as much as digits as its factorization.
1123444430201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38741463.
The product of its (nonzero) digits is 9216, while the sum is 29.
Adding to 1123444430201 its reverse (1020344443211), we get a palindrome (2143788873412).
The spelling of 1123444430201 in words is "one trillion, one hundred twenty-three billion, four hundred forty-four million, four hundred thirty thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •