Recognised as Number
4,667,771
- Positive
- Odd
- Prime
- 7 digits
4,667,771 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 2.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value4,667,771
Digit count7
Digit sum38
Digit product49,392
Multiplicative persistence5times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation4,667,771
Distinct prime factors14,667,771
Number of divisors2
Sum of divisors σ(n)4,667,772
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)4,667,770integers below n that share no factor with it
Carmichael function λ(n)4,667,770the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)−11 distinct prime factor, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 4,667,7712 in total
Arithmetic
Previous number4,667,770
Next number4,667,772
Double9,335,542
Half2,333,885.5
Square21,788,086,108,441
Cube101,701,796,482,483,755,011
Square root2,160.502487849≈irrational, shown to 9 decimal places
Cube root167.123111916≈
Negation-4,667,771
Reciprocal2.14235017 × 10^-7≈
Representations
Decimal4,667,771
Binary1000111001110010111101123 bits
Octal21634573
Hexadecimal47397B
Base 362S1OB
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfour million, six hundred and sixty-seven thousand, seven hundred and seventy-one
Ordinalfour million, six hundred and sixty-seven thousand, seven hundred and seventy-first
Scientific notation4.667771 × 10^6
Engineering notation4.667771 × 10^6
In other bases
Ternary22210010222102base 3; the most digit-efficient integer base after e: 14 digits
Quinary2143332041base 5; one hand: 10 digits
Septenary54450443base 7: 8 digits
Nonary8703872base 9; each digit is two ternary digits: 7 digits
Duodecimal169130bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal19398bbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal21:36:36:11base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary100T1001100T11Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10110110100111010001111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000010001110011100101111011
Bit length23 bitsto write the magnitude
Set bits14the population count, or Hamming weight
Zero bits9within that length
Bit parityeven14 set bits, so even; not the same as the number itself being odd
Highest set bitbit 22worth 4,194,304
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes347 39 7b
Gray code11001001010010111000110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000010001110011100101111011
64-bit0000000000000000000000000000000000000000010001110011100101111011
One's complement11111111101110001100011010000100at 32 bits, every bit flipped
Bits reversed11011110100111001110001000000000at 32 bits
Rotated left by 100000000100011100111001011110110at 32 bits, wrapping
Shifted left by 1100011100111001011110110= 9,335,542, no wrap
Shifted right by 11000111001110010111101= 2,333,885, discarding the low bit
These bits as a double2.30618529 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
4,667,771 to the power 221,788,086,108,441
4,667,771 to the power 3101,701,796,482,483,755,011
4,667,771 to the power 4474,720,696,268,839,679,611,450,481
4,667,771 to the power 52,215,887,499,143,498,060,139,619,823,147,851
First ten multiples4,667,771, 9,335,542, 14,003,313, 18,671,084, 23,338,855, 28,006,626, 32,674,397, 37,342,168, 42,009,939, 46,677,710
Powers of twoBetween 2^22 (4,194,304) and 2^23 (8,388,608)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 2
Divisible by 4No, remainder 3
Divisible by 5No, remainder 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 3
Divisible by 8No, remainder 3
Divisible by 9No, remainder 2
Divisible by 10No, remainder 1
Divisible by 11No, remainder 9
Divisible by 12No, remainder 11
Divisible by 100No, remainder 71
Collatz (3n + 1) trajectory
Steps to reach 1193the total stopping time
Highest value reached23,630,5965× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps4,667,771 → 14,003,314 → 7,001,657 → 21,004,972 → 10,502,486 → 5,251,243 → 15,753,730 → 7,876,865 → 23,630,596 → 11,815,298 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage466,777,100%
4,667,771% as a decimal46,677.71
4,667,771% of 1004,667,771
4,667,771% of 1,00046,677,710
As a fraction of 1004,667,771/100
Read another way
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from 4,667,771
Nerdulate something else
Nothing in mind? Surprise me · today’s page