Base | Representation |
---|---|
bin | 111101011101011000101… |
… | …101010101001011100011 |
3 | 112221202102212121011220101 |
4 | 331131120231111023203 |
5 | 1023144101412131321 |
6 | 12552115544523231 |
7 | 614063544164452 |
oct | 75353055251343 |
9 | 15852385534811 |
10 | 4223441130211 |
11 | 138917345a956 |
12 | 582645a80517 |
13 | 2483656b9454 |
14 | 1085b673cb99 |
15 | 74cdc329791 |
hex | 3d758b552e3 |
4223441130211 has 8 divisors (see below), whose sum is σ = 4304666973024. Its totient is φ = 4142819197440.
The previous prime is 4223441130203. The next prime is 4223441130241. The reversal of 4223441130211 is 1120311443224.
It is a happy number.
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 4223441130211 - 23 = 4223441130203 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 4223441130211.
It is not an unprimeable number, because it can be changed into a prime (4223441130241) 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, 150963390 + ... + 150991363.
It is an arithmetic number, because the mean of its divisors is an integer number (538083371628).
Almost surely, 24223441130211 is an apocalyptic number.
4223441130211 is a deficient number, since it is larger than the sum of its proper divisors (81225842813).
4223441130211 is a wasteful number, since it uses less digits than its factorization.
4223441130211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 301955021.
The product of its (nonzero) digits is 4608, while the sum is 28.
Adding to 4223441130211 its reverse (1120311443224), we get a palindrome (5343752573435).
The spelling of 4223441130211 in words is "four trillion, two hundred twenty-three billion, four hundred forty-one million, one hundred thirty thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •