Base | Representation |
---|---|
bin | 1010111111001… |
… | …0010100110011 |
3 | 10012201011200222 |
4 | 2233302110303 |
5 | 43244100311 |
6 | 4323403255 |
7 | 1066453622 |
oct | 257622463 |
9 | 105634628 |
10 | 46081331 |
11 | 2401464a |
12 | 1352352b |
13 | 971587a |
14 | 61976b9 |
15 | 40a3adb |
hex | 2bf2533 |
46081331 has 2 divisors, whose sum is σ = 46081332. Its totient is φ = 46081330.
The previous prime is 46081313. The next prime is 46081349. The reversal of 46081331 is 13318064.
Together with previous prime (46081313) it forms an Ormiston pair, because they use the same digits, order apart.
It is a balanced prime because it is at equal distance from previous prime (46081313) and next prime (46081349).
It is a cyclic number.
It is not a de Polignac number, because 46081331 - 214 = 46064947 is a prime.
It is a super-2 number, since 2×460813312 = 4246978133463122, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 46081331.
It is not a weakly prime, because it can be changed into another prime (46081361) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 23040665 + 23040666.
It is an arithmetic number, because the mean of its divisors is an integer number (23040666).
Almost surely, 246081331 is an apocalyptic number.
46081331 is a deficient number, since it is larger than the sum of its proper divisors (1).
46081331 is an equidigital number, since it uses as much as digits as its factorization.
46081331 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1728, while the sum is 26.
The square root of 46081331 is about 6788.3231360919. The cubic root of 46081331 is about 358.5158315141.
Adding to 46081331 its reverse (13318064), we get a palindrome (59399395).
The spelling of 46081331 in words is "forty-six million, eighty-one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •