Base | Representation |
---|---|
bin | 1000101101100001… |
… | …11110110110001111 |
3 | 110001221102110102221 |
4 | 10112300332312033 |
5 | 34034242001013 |
6 | 2052030200211 |
7 | 223620022402 |
oct | 42660766617 |
9 | 13057373387 |
10 | 4676906383 |
11 | 1a8aa9aa96 |
12 | aa6353067 |
13 | 596c36536 |
14 | 3251d9d39 |
15 | 1c58d508d |
hex | 116c3ed8f |
4676906383 has 2 divisors, whose sum is σ = 4676906384. Its totient is φ = 4676906382.
The previous prime is 4676906371. The next prime is 4676906483. The reversal of 4676906383 is 3836096764.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4676906383 is a prime.
It is a super-2 number, since 2×46769063832 = 43746906630692285378, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 4676906383.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4676906323) 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 as a sum of consecutive naturals, namely, 2338453191 + 2338453192.
It is an arithmetic number, because the mean of its divisors is an integer number (2338453192).
Almost surely, 24676906383 is an apocalyptic number.
4676906383 is a deficient number, since it is larger than the sum of its proper divisors (1).
4676906383 is an equidigital number, since it uses as much as digits as its factorization.
4676906383 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3919104, while the sum is 52.
The square root of 4676906383 is about 68387.9110881448. The cubic root of 4676906383 is about 1672.3206746975.
The spelling of 4676906383 in words is "four billion, six hundred seventy-six million, nine hundred six thousand, three hundred eighty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •