Recognised as Number
4,281,667
- Positive
- Odd
- Composite
- 7 digits
4,281,667 is an odd 7-digit integer and a composite number. It has 8 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value4,281,667
Digit count7
Digit sum34
Digit product16,128
Multiplicative persistence5times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation13 × 373 × 883
Distinct prime factors313, 373, 883
Number of divisors8
Sum of divisors σ(n)4,628,624
Aliquot sum346,957sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,937,248integers below n that share no factor with it
Carmichael function λ(n)54,684the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 3,937,248
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 13, 373, 883, 4,849, 11,479, 329,359, 4,281,6678 in total
Arithmetic
Previous number4,281,666
Next number4,281,668
Double8,563,334
Half2,140,833.5
Square18,332,672,298,889
Cube78,494,398,003,967,167,963
Square root2,069.218934767≈irrational, shown to 9 decimal places
Cube root162.381903939≈
Negation-4,281,667
Reciprocal2.33553894 × 10^-7≈
Representations
Decimal4,281,667
Binary1000001010101010100001123 bits
Octal20252503
Hexadecimal415543
Base 362JRR7
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfour million, two hundred and eighty-one thousand, six hundred and sixty-seven
Ordinalfour million, two hundred and eighty-one thousand, six hundred and sixty-seventh
Scientific notation4.281667 × 10^6
Engineering notation4.281667 × 10^6
In other bases
Ternary22001112100021base 3; the most digit-efficient integer base after e: 14 digits
Quinary2044003132base 5; one hand: 10 digits
Septenary51251665base 7: 8 digits
Nonary8045307base 9; each digit is two ternary digits: 7 digits
Duodecimal1525997base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal16f437base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal19:49:21:7base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10T01TTTT1001T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10000010101010101000111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000010000010101010101000011
Bit length23 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits14within that length
Bit parityodd9 set bits, so odd; 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
Bytes341 55 43
Gray code11000011111111111100010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000010000010101010101000011
64-bit0000000000000000000000000000000000000000010000010101010101000011
One's complement11111111101111101010101010111100at 32 bits, every bit flipped
Bits reversed11000010101010101000001000000000at 32 bits
Rotated left by 100000000100000101010101010000110at 32 bits, wrapping
Shifted left by 1100000101010101010000110= 8,563,334, no wrap
Shifted right by 11000001010101010100001= 2,140,833, discarding the low bit
These bits as a double2.11542457 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
4,281,667 to the power 218,332,672,298,889
4,281,667 to the power 378,494,398,003,967,167,963
4,281,667 to the power 4336,086,873,618,452,092,150,634,321
4,281,667 to the power 51,439,012,075,905,296,914,042,330,001,293,107
First ten multiples4,281,667, 8,563,334, 12,845,001, 17,126,668, 21,408,335, 25,690,002, 29,971,669, 34,253,336, 38,535,003, 42,816,670
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 1
Divisible by 4No, remainder 3
Divisible by 5No, remainder 2
Divisible by 6No, remainder 1
Divisible by 7No, remainder 5
Divisible by 8No, remainder 3
Divisible by 9No, remainder 7
Divisible by 10No, remainder 7
Divisible by 11No, remainder 5
Divisible by 12No, remainder 7
Divisible by 100No, remainder 67
Collatz (3n + 1) trajectory
Steps to reach 1149the total stopping time
Highest value reached19,267,5044× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps4,281,667 → 12,845,002 → 6,422,501 → 19,267,504 → 9,633,752 → 4,816,876 → 2,408,438 → 1,204,219 → 3,612,658 → 1,806,329 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage428,166,700%
4,281,667% as a decimal42,816.67
4,281,667% of 1004,281,667
4,281,667% of 1,00042,816,670
As a fraction of 1004,281,667/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,281,667
Nerdulate something else
Nothing in mind? Surprise me · today’s page