Base | Representation |
---|---|
bin | 10001110100001001011… |
… | …100011111101011100101 |
3 | 11100000221021201010120201 |
4 | 101310021130133223211 |
5 | 130024202340102401 |
6 | 2334222324030501 |
7 | 154306262346610 |
oct | 21641134375345 |
9 | 4300837633521 |
10 | 1224224144101 |
11 | 4322106830a2 |
12 | 17931a232431 |
13 | 8b5a0172a9a |
14 | 4337782d177 |
15 | 21ca1704b01 |
hex | 11d0971fae5 |
1224224144101 has 8 divisors (see below), whose sum is σ = 1399273844480. Its totient is φ = 1049214577968.
The previous prime is 1224224144063. The next prime is 1224224144107. The reversal of 1224224144101 is 1014414224221.
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 1224224144101 - 239 = 674468330213 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1224224144101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1224224144107) 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, 9968166 + ... + 10090231.
It is an arithmetic number, because the mean of its divisors is an integer number (174909230560).
Almost surely, 21224224144101 is an apocalyptic number.
It is an amenable number.
1224224144101 is a deficient number, since it is larger than the sum of its proper divisors (175049700379).
1224224144101 is an equidigital number, since it uses as much as digits as its factorization.
1224224144101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20067123.
The product of its (nonzero) digits is 4096, while the sum is 28.
Adding to 1224224144101 its reverse (1014414224221), we get a palindrome (2238638368322).
The spelling of 1224224144101 in words is "one trillion, two hundred twenty-four billion, two hundred twenty-four million, one hundred forty-four thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •