Base | Representation |
---|---|
bin | 1010111111011… |
… | …1011011010111 |
3 | 10012202020101001 |
4 | 2233313123113 |
5 | 43300232411 |
6 | 4324044131 |
7 | 1066601560 |
oct | 257673327 |
9 | 105666331 |
10 | 46102231 |
11 | 2402931a |
12 | 13533647 |
13 | 9722236 |
14 | 61a1167 |
15 | 40a9dc1 |
hex | 2bf76d7 |
46102231 has 8 divisors (see below), whose sum is σ = 53475200. Its totient is φ = 38926008.
The previous prime is 46102229. The next prime is 46102241. The reversal of 46102231 is 13220164.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 46102231 - 21 = 46102229 is a prime.
It is a super-2 number, since 2×461022312 = 4250831406354722, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 46102199 and 46102208.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (46102241) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 48681 + ... + 49618.
It is an arithmetic number, because the mean of its divisors is an integer number (6684400).
Almost surely, 246102231 is an apocalyptic number.
46102231 is a deficient number, since it is larger than the sum of its proper divisors (7372969).
46102231 is an equidigital number, since it uses as much as digits as its factorization.
46102231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 98373.
The product of its (nonzero) digits is 288, while the sum is 19.
The square root of 46102231 is about 6789.8623697392. The cubic root of 46102231 is about 358.5700244537.
Adding to 46102231 its reverse (13220164), we get a palindrome (59322395).
The spelling of 46102231 in words is "forty-six million, one hundred two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.033 sec. • engine limits •