Base | Representation |
---|---|
bin | 1011000100110… |
… | …1000001011111 |
3 | 10020102001022020 |
4 | 2301031001133 |
5 | 43342442311 |
6 | 4335351223 |
7 | 1102561665 |
oct | 261150137 |
9 | 106361266 |
10 | 46452831 |
11 | 24248777 |
12 | 13682513 |
13 | 98159a9 |
14 | 6252c35 |
15 | 4128c06 |
hex | 2c4d05f |
46452831 has 8 divisors (see below), whose sum is σ = 62485680. Its totient is φ = 30694272.
The previous prime is 46452811. The next prime is 46452839. The reversal of 46452831 is 13825464.
46452831 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 46452831 - 25 = 46452799 is a prime.
It is a super-2 number, since 2×464528312 = 4315731015829122, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 46452792 and 46452801.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (46452839) 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 7 ways as a sum of consecutive naturals, for example, 68176 + ... + 68853.
It is an arithmetic number, because the mean of its divisors is an integer number (7810710).
Almost surely, 246452831 is an apocalyptic number.
46452831 is a deficient number, since it is larger than the sum of its proper divisors (16032849).
46452831 is a wasteful number, since it uses less digits than its factorization.
46452831 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 137145.
The product of its digits is 23040, while the sum is 33.
The square root of 46452831 is about 6815.6313720741. The cubic root of 46452831 is about 359.4766856398.
The spelling of 46452831 in words is "forty-six million, four hundred fifty-two thousand, eight hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •