Base | Representation |
---|---|
bin | 1111010011000011… |
… | …0001010100011111 |
3 | 101121011222000222012 |
4 | 3310300301110133 |
5 | 31402221110011 |
6 | 1515250541435 |
7 | 203522020250 |
oct | 36460612437 |
9 | 11534860865 |
10 | 4106425631 |
11 | 1817a743a0 |
12 | 96729787b |
13 | 5059a4b69 |
14 | 2ad538b27 |
15 | 190798a8b |
hex | f4c3151f |
4106425631 has 8 divisors (see below), whose sum is σ = 5119699584. Its totient is φ = 3199812120.
The previous prime is 4106425627. The next prime is 4106425639. The reversal of 4106425631 is 1365246014.
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 4106425631 - 22 = 4106425627 is a prime.
It is a super-2 number, since 2×41064256312 = 33725462925867496322, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4106425639) 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, 26665025 + ... + 26665178.
It is an arithmetic number, because the mean of its divisors is an integer number (639962448).
Almost surely, 24106425631 is an apocalyptic number.
4106425631 is a deficient number, since it is larger than the sum of its proper divisors (1013273953).
4106425631 is a wasteful number, since it uses less digits than its factorization.
4106425631 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53330221.
The product of its (nonzero) digits is 17280, while the sum is 32.
The square root of 4106425631 is about 64081.3984788097. The cubic root of 4106425631 is about 1601.3563539016.
The spelling of 4106425631 in words is "four billion, one hundred six million, four hundred twenty-five thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •