Base | Representation |
---|---|
bin | 1011001011110… |
… | …0011000010110 |
3 | 10021021012222112 |
4 | 2302330120112 |
5 | 44002041300 |
6 | 4353231022 |
7 | 1106501534 |
oct | 262743026 |
9 | 107235875 |
10 | 46908950 |
11 | 2452a430 |
12 | 13862472 |
13 | 994549a |
14 | 6331154 |
15 | 41b8e35 |
hex | 2cbc616 |
46908950 has 96 divisors (see below), whose sum is σ = 104859360. Its totient is φ = 15411200.
The previous prime is 46908941. The next prime is 46908959. The reversal of 46908950 is 5980964.
46908950 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (46908941) and next prime (46908959).
It is a junction number, because it is equal to n+sod(n) for n = 46908898 and 46908907.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (46908959) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 271064 + ... + 271236.
It is an arithmetic number, because the mean of its divisors is an integer number (1092285).
Almost surely, 246908950 is an apocalyptic number.
46908950 is an abundant number, since it is smaller than the sum of its proper divisors (57950410).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
46908950 is a wasteful number, since it uses less digits than its factorization.
46908950 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 242 (or 237 counting only the distinct ones).
The product of its (nonzero) digits is 77760, while the sum is 41.
The square root of 46908950 is about 6849.0108774917. The cubic root of 46908950 is about 360.6494193441.
The spelling of 46908950 in words is "forty-six million, nine hundred eight thousand, nine hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •