Base | Representation |
---|---|
bin | 1000101011111100… |
… | …10011010110110011 |
3 | 110001000102111101022 |
4 | 10111332103112303 |
5 | 34022341333133 |
6 | 2050433330055 |
7 | 223366060544 |
oct | 42576232663 |
9 | 13030374338 |
10 | 4663621043 |
11 | 1a83546574 |
12 | aa1a0692b |
13 | 5942644a3 |
14 | 32353c4cb |
15 | 1c465d998 |
hex | 115f935b3 |
4663621043 has 4 divisors (see below), whose sum is σ = 4663995168. Its totient is φ = 4663246920.
The previous prime is 4663621037. The next prime is 4663621057. The reversal of 4663621043 is 3401263664.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 4663621043 - 26 = 4663620979 is a prime.
It is a super-2 number, since 2×46636210432 = 43498722465424815698, 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 = 4663620994 and 4663621012.
It is not an unprimeable number, because it can be changed into a prime (4663621073) 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 3 ways as a sum of consecutive naturals, for example, 167696 + ... + 193517.
It is an arithmetic number, because the mean of its divisors is an integer number (1165998792).
Almost surely, 24663621043 is an apocalyptic number.
4663621043 is a deficient number, since it is larger than the sum of its proper divisors (374125).
4663621043 is a wasteful number, since it uses less digits than its factorization.
4663621043 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 374124.
The product of its (nonzero) digits is 62208, while the sum is 35.
The square root of 4663621043 is about 68290.7097854459. The cubic root of 4663621043 is about 1670.7356939966.
The spelling of 4663621043 in words is "four billion, six hundred sixty-three million, six hundred twenty-one thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •