Base | Representation |
---|---|
bin | 1011000000001… |
… | …1100110011010 |
3 | 10012211202202200 |
4 | 2300003212122 |
5 | 43303331330 |
6 | 4325111030 |
7 | 1100200125 |
oct | 260034632 |
9 | 105752680 |
10 | 46152090 |
11 | 24062826 |
12 | 13558476 |
13 | 973bb3a |
14 | 61b53bc |
15 | 40b9a60 |
hex | 2c0399a |
46152090 has 48 divisors (see below), whose sum is σ = 120662568. Its totient is φ = 12238848.
The previous prime is 46152023. The next prime is 46152091. The reversal of 46152090 is 9025164.
It can be written as a sum of positive squares in 4 ways, for example, as 34680321 + 11471769 = 5889^2 + 3387^2 .
It is a super-2 number, since 2×461520902 = 4260030822736200, which contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (46152091) 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 23 ways as a sum of consecutive naturals, for example, 16042 + ... + 18698.
Almost surely, 246152090 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 46152090, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (60331284).
46152090 is an abundant number, since it is smaller than the sum of its proper divisors (74510478).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
46152090 is a wasteful number, since it uses less digits than its factorization.
46152090 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2863 (or 2860 counting only the distinct ones).
The product of its (nonzero) digits is 2160, while the sum is 27.
The square root of 46152090 is about 6793.5329542146. The cubic root of 46152090 is about 358.6992409175.
The spelling of 46152090 in words is "forty-six million, one hundred fifty-two thousand, ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •