Base | Representation |
---|---|
bin | 1111010010011111… |
… | …1001110100010101 |
3 | 101121000120221100222 |
4 | 3310213321310111 |
5 | 31401122214031 |
6 | 1515125044125 |
7 | 203463166310 |
oct | 36447716425 |
9 | 11530527328 |
10 | 4104101141 |
11 | 1816726a28 |
12 | 966556645 |
13 | 50536cb1a |
14 | 2ad0d1977 |
15 | 190489e7b |
hex | f49f9d15 |
4104101141 has 16 divisors (see below), whose sum is σ = 4855113600. Its totient is φ = 3394415808.
The previous prime is 4104101101. The next prime is 4104101149. The reversal of 4104101141 is 1411014014.
4104101141 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 4104101141 - 230 = 3030359317 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4104101149) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 387170 + ... + 397628.
It is an arithmetic number, because the mean of its divisors is an integer number (303444600).
Almost surely, 24104101141 is an apocalyptic number.
It is an amenable number.
4104101141 is a deficient number, since it is larger than the sum of its proper divisors (751012459).
4104101141 is a wasteful number, since it uses less digits than its factorization.
4104101141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12428.
The product of its (nonzero) digits is 64, while the sum is 17.
The square root of 4104101141 is about 64063.2589008708. The cubic root of 4104101141 is about 1601.0541414064.
Adding to 4104101141 its reverse (1411014014), we get a palindrome (5515115155).
The spelling of 4104101141 in words is "four billion, one hundred four million, one hundred one thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •