Base | Representation |
---|---|
bin | 11100010010100… |
… | …110111101100111 |
3 | 1020002010012222211 |
4 | 130102212331213 |
5 | 1433001441411 |
6 | 115033104251 |
7 | 14522242522 |
oct | 3422467547 |
9 | 1202105884 |
10 | 474640231 |
11 | 223a1625a |
12 | 112b58087 |
13 | 77446210 |
14 | 47073bb9 |
15 | 2ba09221 |
hex | 1c4a6f67 |
474640231 has 16 divisors (see below), whose sum is σ = 529976160. Its totient is φ = 422254080.
The previous prime is 474640217. The next prime is 474640237. The reversal of 474640231 is 132046474.
It is a de Polignac number, because none of the positive numbers 2k-474640231 is a prime.
It is a super-2 number, since 2×4746402312 = 450566697767466722, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 474640193 and 474640202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (474640237) 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 15 ways as a sum of consecutive naturals, for example, 38875 + ... + 49603.
It is an arithmetic number, because the mean of its divisors is an integer number (33123510).
Almost surely, 2474640231 is an apocalyptic number.
474640231 is a gapful number since it is divisible by the number (41) formed by its first and last digit.
474640231 is a deficient number, since it is larger than the sum of its proper divisors (55335929).
474640231 is a wasteful number, since it uses less digits than its factorization.
474640231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10866.
The product of its (nonzero) digits is 16128, while the sum is 31.
The square root of 474640231 is about 21786.2394873461. The cubic root of 474640231 is about 780.0483374603.
The spelling of 474640231 in words is "four hundred seventy-four million, six hundred forty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •