Base | Representation |
---|---|
bin | 1000101011111100… |
… | …11010011101010011 |
3 | 110001000110222021122 |
4 | 10111332122131103 |
5 | 34022343301011 |
6 | 2050434112455 |
7 | 223366241420 |
oct | 42576323523 |
9 | 13030428248 |
10 | 4663650131 |
11 | 1a83566408 |
12 | aa1a1b72b |
13 | 5942747ba |
14 | 323548d47 |
15 | 1c46673db |
hex | 115f9a753 |
4663650131 has 8 divisors (see below), whose sum is σ = 5561620224. Its totient is φ = 3823613640.
The previous prime is 4663650113. The next prime is 4663650133. The reversal of 4663650131 is 1310563664.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-4663650131 is a prime.
It is a super-2 number, since 2×46636501312 = 43499265088752634322, 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 = 4663650091 and 4663650100.
It is not an unprimeable number, because it can be changed into a prime (4663650133) 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, 14483225 + ... + 14483546.
It is an arithmetic number, because the mean of its divisors is an integer number (695202528).
Almost surely, 24663650131 is an apocalyptic number.
4663650131 is a deficient number, since it is larger than the sum of its proper divisors (897970093).
4663650131 is a wasteful number, since it uses less digits than its factorization.
4663650131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28966801.
The product of its (nonzero) digits is 38880, while the sum is 35.
The square root of 4663650131 is about 68290.9227569814. The cubic root of 4663650131 is about 1670.7391675677.
The spelling of 4663650131 in words is "four billion, six hundred sixty-three million, six hundred fifty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •