Base | Representation |
---|---|
bin | 1011000110010… |
… | …1010100110000 |
3 | 10020121002211210 |
4 | 2301211110300 |
5 | 43404133433 |
6 | 4341440120 |
7 | 1103455122 |
oct | 261452460 |
9 | 106532753 |
10 | 46552368 |
11 | 24306535 |
12 | 13710040 |
13 | 984c0a5 |
14 | 627b212 |
15 | 4148463 |
hex | 2c65530 |
46552368 has 80 divisors (see below), whose sum is σ = 126777600. Its totient is φ = 14691072.
The previous prime is 46552361. The next prime is 46552369. The reversal of 46552368 is 86325564.
It is not an unprimeable number, because it can be changed into a prime (46552361) 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 15 ways as a sum of consecutive naturals, for example, 164355 + ... + 164637.
It is an arithmetic number, because the mean of its divisors is an integer number (1584720).
Almost surely, 246552368 is an apocalyptic number.
46552368 is a gapful number since it is divisible by the number (48) 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 46552368, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (63388800).
46552368 is an abundant number, since it is smaller than the sum of its proper divisors (80225232).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
46552368 is a wasteful number, since it uses less digits than its factorization.
46552368 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 466 (or 460 counting only the distinct ones).
The product of its digits is 172800, while the sum is 39.
The square root of 46552368 is about 6822.9295760692. The cubic root of 46552368 is about 359.7332591982.
The spelling of 46552368 in words is "forty-six million, five hundred fifty-two thousand, three hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •