Base | Representation |
---|---|
bin | 111011101110010110110… |
… | …101010000111100010111 |
3 | 112112100201110010101101000 |
4 | 323232112311100330113 |
5 | 1014220422411004421 |
6 | 12421242110434343 |
7 | 602343335024226 |
oct | 73562665207427 |
9 | 15470643111330 |
10 | 4104224313111 |
11 | 134265669a72a |
12 | 5635145029b3 |
13 | 23a046847520 |
14 | 102907424cbd |
15 | 71b60ec8226 |
hex | 3bb96d50f17 |
4104224313111 has 128 divisors (see below), whose sum is σ = 6983878164480. Its totient is φ = 2364286579200.
The previous prime is 4104224313103. The next prime is 4104224313121. The reversal of 4104224313111 is 1113134224014.
It is a happy number.
4104224313111 is a `hidden beast` number, since 4 + 10 + 4 + 224 + 313 + 111 = 666.
It is not a de Polignac number, because 4104224313111 - 23 = 4104224313103 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4104224313121) by changing a digit.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 40895085 + ... + 40995321.
It is an arithmetic number, because the mean of its divisors is an integer number (54561548160).
Almost surely, 24104224313111 is an apocalyptic number.
4104224313111 is a deficient number, since it is larger than the sum of its proper divisors (2879653851369).
4104224313111 is a wasteful number, since it uses less digits than its factorization.
4104224313111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 100414 (or 100408 counting only the distinct ones).
The product of its (nonzero) digits is 2304, while the sum is 27.
Adding to 4104224313111 its reverse (1113134224014), we get a palindrome (5217358537125).
The spelling of 4104224313111 in words is "four trillion, one hundred four billion, two hundred twenty-four million, three hundred thirteen thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •