Base | Representation |
---|---|
bin | 11100000110011… |
… | …111100001011111 |
3 | 1012212010212001210 |
4 | 130012133201133 |
5 | 1431143322111 |
6 | 114441035503 |
7 | 14453243463 |
oct | 3406374137 |
9 | 1185125053 |
10 | 471464031 |
11 | 2221469a5 |
12 | 111a85b93 |
13 | 768a35cc |
14 | 468884a3 |
15 | 2b5cd0a6 |
hex | 1c19f85f |
471464031 has 4 divisors (see below), whose sum is σ = 628618712. Its totient is φ = 314309352.
The previous prime is 471464023. The next prime is 471464033. The reversal of 471464031 is 130464174.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 471464031 - 23 = 471464023 is a prime.
It is a super-2 number, since 2×4714640312 = 444556665053537922, which contains 22 as substring.
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 471464031.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (471464033) 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 3 ways as a sum of consecutive naturals, for example, 78577336 + ... + 78577341.
It is an arithmetic number, because the mean of its divisors is an integer number (157154678).
Almost surely, 2471464031 is an apocalyptic number.
471464031 is a deficient number, since it is larger than the sum of its proper divisors (157154681).
471464031 is a wasteful number, since it uses less digits than its factorization.
471464031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 157154680.
The product of its (nonzero) digits is 8064, while the sum is 30.
The square root of 471464031 is about 21713.2224922972. Note that the first 3 decimals coincide. The cubic root of 471464031 is about 778.3044645781.
The spelling of 471464031 in words is "four hundred seventy-one million, four hundred sixty-four thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •