Recognised as Number
4,271,963
- Positive
- Odd
- Prime
- 7 digits
4,271,963 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 5.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value4,271,963
Digit count7
Digit sum32
Digit product9,072
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation4,271,963
Distinct prime factors14,271,963
Number of divisors2
Sum of divisors σ(n)4,271,964
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)4,271,962integers below n that share no factor with it
Carmichael function λ(n)4,271,962the 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,271,9632 in total
Arithmetic
Previous number4,271,962
Next number4,271,964
Double8,543,926
Half2,135,981.5
Square18,249,667,873,369
Cube77,961,905,917,321,053,347
Square root2,066.872758541≈irrational, shown to 9 decimal places
Cube root162.259136651≈
Negation-4,271,963
Reciprocal2.34084424 × 10^-7≈
Representations
Decimal4,271,963
Binary1000001001011110101101123 bits
Octal20227533
Hexadecimal412F5B
Base 362JK9N
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfour million, two hundred and seventy-one thousand, nine hundred and sixty-three
Ordinalfour million, two hundred and seventy-one thousand, nine hundred and sixty-third
Scientific notation4.271963 × 10^6
Engineering notation4.271963 × 10^6
In other bases
Ternary22001001000212base 3; the most digit-efficient integer base after e: 14 digits
Quinary2043200323base 5; one hand: 10 digits
Septenary51211463base 7: 8 digits
Nonary8031025base 9; each digit is two ternary digits: 7 digits
Duodecimal152024bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal16dji3base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal19:46:39:23base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10T0010010010TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10000010111000010101111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000010000010010111101011011
Bit length23 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits11within that length
Bit parityeven12 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
Bytes341 2f 5b
Gray code11000011011100011110110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000010000010010111101011011
64-bit0000000000000000000000000000000000000000010000010010111101011011
One's complement11111111101111101101000010100100at 32 bits, every bit flipped
Bits reversed11011010111101001000001000000000at 32 bits
Rotated left by 100000000100000100101111010110110at 32 bits, wrapping
Shifted left by 1100000100101111010110110= 8,543,926, no wrap
Shifted right by 11000001001011110101101= 2,135,981, discarding the low bit
These bits as a double2.11063016 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
4,271,963 to the power 218,249,667,873,369
4,271,963 to the power 377,961,905,917,321,053,347
4,271,963 to the power 4333,050,377,488,276,599,019,410,161
4,271,963 to the power 51,422,778,889,765,950,564,776,756,489,616,043
First ten multiples4,271,963, 8,543,926, 12,815,889, 17,087,852, 21,359,815, 25,631,778, 29,903,741, 34,175,704, 38,447,667, 42,719,630
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 3
Divisible by 6No, remainder 5
Divisible by 7No, remainder 3
Divisible by 8No, remainder 3
Divisible by 9No, remainder 5
Divisible by 10No, remainder 3
Divisible by 11No, remainder 3
Divisible by 12No, remainder 11
Divisible by 100No, remainder 63
Collatz (3n + 1) trajectory
Steps to reach 1242the total stopping time
Highest value reached103,925,96824× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps4,271,963 → 12,815,890 → 6,407,945 → 19,223,836 → 9,611,918 → 4,805,959 → 14,417,878 → 7,208,939 → 21,626,818 → 10,813,409 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage427,196,300%
4,271,963% as a decimal42,719.63
4,271,963% of 1004,271,963
4,271,963% of 1,00042,719,630
As a fraction of 1004,271,963/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,271,963
Nerdulate something else
Nothing in mind? Surprise me · today’s page