Recognised as Number
4,128,713
- Positive
- Odd
- Prime
- 7 digits
4,128,713 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 8.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value4,128,713
Digit count7
Digit sum26
Digit product1,344
Multiplicative persistence4times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation4,128,713
Distinct prime factors14,128,713
Number of divisors2
Sum of divisors σ(n)4,128,714
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)4,128,712integers below n that share no factor with it
Carmichael function λ(n)4,128,712the 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,128,7132 in total
Arithmetic
Previous number4,128,712
Next number4,128,714
Double8,257,426
Half2,064,356.5
Square17,046,271,036,369
Cube70,379,160,829,380,163,097
Square root2,031.923472968≈irrational, shown to 9 decimal places
Cube root160.424821564≈
Negation-4,128,713
Reciprocal2.42206227 × 10^-7≈
Representations
Decimal4,128,713
Binary111110111111111100100122 bits
Octal17577711
Hexadecimal3EFFC9
Base 362GHQH
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfour million, one hundred and twenty-eight thousand, seven hundred and thirteen
Ordinalfour million, one hundred and twenty-eight thousand, seven hundred and thirteenth
Scientific notation4.128713 × 10^6
Engineering notation4.128713 × 10^6
In other bases
Ternary21202202112022base 3; the most digit-efficient integer base after e: 14 digits
Quinary2024104323base 5; one hand: 10 digits
Septenary50044031base 7: 8 digits
Nonary7682468base 9; each digit is two ternary digits: 7 digits
Duodecimal1471375base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal15g1fdbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal19:6:51:53base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10TT10T10TTT10Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10000110000000011011001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001111101111111111001001
Bit length22 bitsto write the magnitude
Set bits17the population count, or Hamming weight
Zero bits5within that length
Bit parityodd17 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 21worth 2,097,152
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes33e ff c9
Gray code1000011000000000101101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001111101111111111001001
64-bit0000000000000000000000000000000000000000001111101111111111001001
One's complement11111111110000010000000000110110at 32 bits, every bit flipped
Bits reversed10010011111111110111110000000000at 32 bits
Rotated left by 100000000011111011111111110010010at 32 bits, wrapping
Shifted left by 111111011111111110010010= 8,257,426, no wrap
Shifted right by 1111110111111111100100= 2,064,356, discarding the low bit
These bits as a double2.03985525 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
4,128,713 to the power 217,046,271,036,369
4,128,713 to the power 370,379,160,829,380,163,097
4,128,713 to the power 4290,575,356,245,352,661,320,704,161
4,128,713 to the power 51,199,702,250,809,818,722,379,388,438,674,793
First ten multiples4,128,713, 8,257,426, 12,386,139, 16,514,852, 20,643,565, 24,772,278, 28,900,991, 33,029,704, 37,158,417, 41,287,130
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 2
Divisible by 4No, remainder 1
Divisible by 5No, remainder 3
Divisible by 6No, remainder 5
Divisible by 7No, remainder 1
Divisible by 8No, remainder 1
Divisible by 9No, remainder 8
Divisible by 10No, remainder 3
Divisible by 11No, remainder 6
Divisible by 12No, remainder 5
Divisible by 100No, remainder 13
Collatz (3n + 1) trajectory
Steps to reach 1167the total stopping time
Highest value reached40,221,8449× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps4,128,713 → 12,386,140 → 6,193,070 → 3,096,535 → 9,289,606 → 4,644,803 → 13,934,410 → 6,967,205 → 20,901,616 → 10,450,808 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage412,871,300%
4,128,713% as a decimal41,287.13
4,128,713% of 1004,128,713
4,128,713% of 1,00041,287,130
As a fraction of 1004,128,713/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,128,713
Nerdulate something else
Nothing in mind? Surprise me · today’s page