Base | Representation |
---|---|
bin | 1011000110100… |
… | …1001001101000 |
3 | 10020121220100020 |
4 | 2301221021220 |
5 | 43410134130 |
6 | 4342040440 |
7 | 1103551611 |
oct | 261511150 |
9 | 106556306 |
10 | 46568040 |
11 | 24317292 |
12 | 13719120 |
13 | 985626c |
14 | 6282c08 |
15 | 414ce10 |
hex | 2c69268 |
46568040 has 32 divisors (see below), whose sum is σ = 139704480. Its totient is φ = 12418112.
The previous prime is 46568033. The next prime is 46568047. The reversal of 46568040 is 4086564.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (46568033) and next prime (46568047).
It is a junction number, because it is equal to n+sod(n) for n = 46567992 and 46568010.
It is not an unprimeable number, because it can be changed into a prime (46568047) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 193914 + ... + 194153.
It is an arithmetic number, because the mean of its divisors is an integer number (4365765).
Almost surely, 246568040 is an apocalyptic number.
46568040 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
46568040 is an abundant number, since it is smaller than the sum of its proper divisors (93136440).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
46568040 is a wasteful number, since it uses less digits than its factorization.
46568040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 388081 (or 388077 counting only the distinct ones).
The product of its (nonzero) digits is 23040, while the sum is 33.
The square root of 46568040 is about 6824.0779596954. The cubic root of 46568040 is about 359.7736231106.
The spelling of 46568040 in words is "forty-six million, five hundred sixty-eight thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •