Base | Representation |
---|---|
bin | 1010111110010… |
… | …1001110000010 |
3 | 10012121110001210 |
4 | 2233211032002 |
5 | 43240341100 |
6 | 4322310550 |
7 | 1066141254 |
oct | 257451602 |
9 | 105543053 |
10 | 46027650 |
11 | 23a88289 |
12 | 134b8456 |
13 | 96c72c6 |
14 | 6181cd4 |
15 | 4092c50 |
hex | 2be5382 |
46027650 has 48 divisors (see below), whose sum is σ = 115555104. Its totient is φ = 12122880.
The previous prime is 46027649. The next prime is 46027717. The reversal of 46027650 is 5672064.
46027650 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 10602 + ... + 14298.
It is an arithmetic number, because the mean of its divisors is an integer number (2407398).
Almost surely, 246027650 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 46027650, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (57777552).
46027650 is an abundant number, since it is smaller than the sum of its proper divisors (69527454).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
46027650 is a wasteful number, since it uses less digits than its factorization.
46027650 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3795 (or 3790 counting only the distinct ones).
The product of its (nonzero) digits is 10080, while the sum is 30.
The square root of 46027650 is about 6784.3680619495. The cubic root of 46027650 is about 358.3765635002.
The spelling of 46027650 in words is "forty-six million, twenty-seven thousand, six hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •