Base | Representation |
---|---|
bin | 1011001010010… |
… | …1001101011000 |
3 | 10021002101210100 |
4 | 2302211031120 |
5 | 43441022130 |
6 | 4351215400 |
7 | 1105625040 |
oct | 262451530 |
9 | 107071710 |
10 | 46814040 |
11 | 24475099 |
12 | 13817560 |
13 | 9911220 |
14 | 6308720 |
15 | 419ac60 |
hex | 2ca5358 |
46814040 has 192 divisors, whose sum is σ = 187387200. Its totient is φ = 9870336.
The previous prime is 46814017. The next prime is 46814051. The reversal of 46814040 is 4041864.
It is a super-2 number, since 2×468140402 = 4383108682243200, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 46813995 and 46814013.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 32046 + ... + 33474.
It is an arithmetic number, because the mean of its divisors is an integer number (975975).
Almost surely, 246814040 is an apocalyptic number.
46814040 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 46814040, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (93693600).
46814040 is an abundant number, since it is smaller than the sum of its proper divisors (140573160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
46814040 is a wasteful number, since it uses less digits than its factorization.
46814040 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1466 (or 1459 counting only the distinct ones).
The product of its (nonzero) digits is 3072, while the sum is 27.
The square root of 46814040 is about 6842.0786315271. The cubic root of 46814040 is about 360.4060233788.
The spelling of 46814040 in words is "forty-six million, eight hundred fourteen thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •