Base | Representation |
---|---|
bin | 11001001110100… |
… | …111011101100000 |
3 | 1002111102221101011 |
4 | 121032213131200 |
5 | 1331323341143 |
6 | 105555550304 |
7 | 13326445066 |
oct | 3116473540 |
9 | 1074387334 |
10 | 423262048 |
11 | 1a7a14050 |
12 | b98bb394 |
13 | 698c7721 |
14 | 402dc036 |
15 | 2725ae9d |
hex | 193a7760 |
423262048 has 96 divisors (see below), whose sum is σ = 936448128. Its totient is φ = 186700800.
The previous prime is 423262043. The next prime is 423262051. The reversal of 423262048 is 840262324.
It is a super-2 number, since 2×4232620482 = 358301522554308608, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (423262043) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3089436 + ... + 3089572.
It is an arithmetic number, because the mean of its divisors is an integer number (9754668).
Almost surely, 2423262048 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 423262048, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (468224064).
423262048 is an abundant number, since it is smaller than the sum of its proper divisors (513186080).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
423262048 is a wasteful number, since it uses less digits than its factorization.
423262048 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 356 (or 348 counting only the distinct ones).
The product of its (nonzero) digits is 18432, while the sum is 31.
The square root of 423262048 is about 20573.3334197451. Note that the first 3 decimals coincide. The cubic root of 423262048 is about 750.8210552002.
The spelling of 423262048 in words is "four hundred twenty-three million, two hundred sixty-two thousand, forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •