Base | Representation |
---|---|
bin | 1011000101111… |
… | …1001000101100 |
3 | 10020112211001222 |
4 | 2301133020230 |
5 | 43402331040 |
6 | 4341122512 |
7 | 1103321201 |
oct | 261371054 |
9 | 106484058 |
10 | 46527020 |
11 | 24299491 |
12 | 136b9438 |
13 | 98406a7 |
14 | 6271ca8 |
15 | 4140bb5 |
hex | 2c5f22c |
46527020 has 48 divisors (see below), whose sum is σ = 102241440. Its totient is φ = 17762304.
The previous prime is 46527007. The next prime is 46527031. The reversal of 46527020 is 2072564.
46527020 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 15 ways as a sum of consecutive naturals, for example, 55847 + ... + 56673.
It is an arithmetic number, because the mean of its divisors is an integer number (2130030).
Almost surely, 246527020 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 46527020, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (51120720).
46527020 is an abundant number, since it is smaller than the sum of its proper divisors (55714420).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
46527020 is a wasteful number, since it uses less digits than its factorization.
46527020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 962 (or 960 counting only the distinct ones).
The product of its (nonzero) digits is 3360, while the sum is 26.
The square root of 46527020 is about 6821.0717632935. The cubic root of 46527020 is about 359.6679551505.
Adding to 46527020 its reverse (2072564), we get a palindrome (48599584).
The spelling of 46527020 in words is "forty-six million, five hundred twenty-seven thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •