Base | Representation |
---|---|
bin | 1011001011110… |
… | …0101010111101 |
3 | 10021021021121122 |
4 | 2302330222331 |
5 | 44002111031 |
6 | 4353240325 |
7 | 1106505155 |
oct | 262745275 |
9 | 107237548 |
10 | 46910141 |
11 | 24530313 |
12 | 138630a5 |
13 | 9945ba5 |
14 | 6331765 |
15 | 41b947b |
hex | 2cbcabd |
46910141 has 4 divisors (see below), whose sum is σ = 47795292. Its totient is φ = 46024992.
The previous prime is 46910131. The next prime is 46910147. The reversal of 46910141 is 14101964.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 18062500 + 28847641 = 4250^2 + 5371^2 .
It is a cyclic number.
It is not a de Polignac number, because 46910141 - 26 = 46910077 is a prime.
It is a super-2 number, since 2×469101412 = 4401122657279762, which contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 46910141.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (46910147) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 442496 + ... + 442601.
It is an arithmetic number, because the mean of its divisors is an integer number (11948823).
Almost surely, 246910141 is an apocalyptic number.
It is an amenable number.
46910141 is a deficient number, since it is larger than the sum of its proper divisors (885151).
46910141 is an equidigital number, since it uses as much as digits as its factorization.
46910141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 885150.
The product of its (nonzero) digits is 864, while the sum is 26.
The square root of 46910141 is about 6849.0978238013. The cubic root of 46910141 is about 360.6524715678.
The spelling of 46910141 in words is "forty-six million, nine hundred ten thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •