Base | Representation |
---|---|
bin | 1000101010011001… |
… | …01111101111111101 |
3 | 110000002222111012210 |
4 | 10111030233233331 |
5 | 34011030131031 |
6 | 2045251051033 |
7 | 223150463313 |
oct | 42514575775 |
9 | 13002874183 |
10 | 4650630141 |
11 | 1a77183293 |
12 | a995a0a79 |
13 | 591666471 |
14 | 32191a0b3 |
15 | 1c3444746 |
hex | 11532fbfd |
4650630141 has 4 divisors (see below), whose sum is σ = 6200840192. Its totient is φ = 3100420092.
The previous prime is 4650630139. The next prime is 4650630161. The reversal of 4650630141 is 1410360564.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 4650630141 - 21 = 4650630139 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 4650630099 and 4650630108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4650630121) 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, 775105021 + ... + 775105026.
It is an arithmetic number, because the mean of its divisors is an integer number (1550210048).
Almost surely, 24650630141 is an apocalyptic number.
It is an amenable number.
4650630141 is a deficient number, since it is larger than the sum of its proper divisors (1550210051).
4650630141 is a wasteful number, since it uses less digits than its factorization.
4650630141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1550210050.
The product of its (nonzero) digits is 8640, while the sum is 30.
The square root of 4650630141 is about 68195.5287463922. The cubic root of 4650630141 is about 1669.1829271791.
The spelling of 4650630141 in words is "four billion, six hundred fifty million, six hundred thirty thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •