Base | Representation |
---|---|
bin | 1110111011001011… |
… | …0010011000001011 |
3 | 101100012112200000111 |
4 | 3232302302120023 |
5 | 31201102302310 |
6 | 1501312415151 |
7 | 201164624362 |
oct | 35662623013 |
9 | 11305480014 |
10 | 4006290955 |
11 | 17764a0767 |
12 | 9398474b7 |
13 | 4bb014c84 |
14 | 2a01107d9 |
15 | 186ab928a |
hex | eecb260b |
4006290955 has 4 divisors (see below), whose sum is σ = 4807549152. Its totient is φ = 3205032760.
The previous prime is 4006290901. The next prime is 4006290979. The reversal of 4006290955 is 5590926004.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 4006290955 - 229 = 3469420043 is a prime.
It is a super-2 number, since 2×40062909552 = 32100734432229624050, which contains 22 as substring.
It is a Smith number, since the sum of its digits (40) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 400629091 + ... + 400629100.
It is an arithmetic number, because the mean of its divisors is an integer number (1201887288).
Almost surely, 24006290955 is an apocalyptic number.
4006290955 is a deficient number, since it is larger than the sum of its proper divisors (801258197).
4006290955 is an equidigital number, since it uses as much as digits as its factorization.
4006290955 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 801258196.
The product of its (nonzero) digits is 97200, while the sum is 40.
The square root of 4006290955 is about 63295.2680300826. The cubic root of 4006290955 is about 1588.2328051257.
The spelling of 4006290955 in words is "four billion, six million, two hundred ninety thousand, nine hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •