Base | Representation |
---|---|
bin | 1011000101011… |
… | …0001110100011 |
3 | 10020110222000112 |
4 | 2301112032203 |
5 | 43400144111 |
6 | 4340241535 |
7 | 1103106623 |
oct | 261261643 |
9 | 106428015 |
10 | 46490531 |
11 | 2427402a |
12 | 136a02ab |
13 | 9829bb9 |
14 | 6262883 |
15 | 4134e8b |
hex | 2c563a3 |
46490531 has 2 divisors, whose sum is σ = 46490532. Its totient is φ = 46490530.
The previous prime is 46490513. The next prime is 46490569. The reversal of 46490531 is 13509464.
46490531 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
Together with previous prime (46490513) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 46490531 - 222 = 42296227 is a prime.
It is a super-2 number, since 2×464905312 = 4322738945323922, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (46490501) 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 as a sum of consecutive naturals, namely, 23245265 + 23245266.
It is an arithmetic number, because the mean of its divisors is an integer number (23245266).
Almost surely, 246490531 is an apocalyptic number.
46490531 is a deficient number, since it is larger than the sum of its proper divisors (1).
46490531 is an equidigital number, since it uses as much as digits as its factorization.
46490531 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12960, while the sum is 32.
The square root of 46490531 is about 6818.3965123774. The cubic root of 46490531 is about 359.5739068868.
Adding to 46490531 its reverse (13509464), we get a palindrome (59999995).
The spelling of 46490531 in words is "forty-six million, four hundred ninety thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •