Recognised as Number
3,124,301
- Positive
- Odd
- Prime
- 7 digits
3,124,301 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 value3,124,301
Digit count7
Digit sum14
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times 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 factorisation3,124,301
Distinct prime factors13,124,301
Number of divisors2
Sum of divisors σ(n)3,124,302
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,124,300integers below n that share no factor with it
Carmichael function λ(n)3,124,300the 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, 3,124,3012 in total
Arithmetic
Previous number3,124,300
Next number3,124,302
Double6,248,602
Half1,562,150.5
Square9,761,256,738,601
Cube30,497,104,189,667,842,901
Square root1,767.569234853≈irrational, shown to 9 decimal places
Cube root146.18998536≈
Negation-3,124,301
Reciprocal3.20071594 × 10^-7≈
Representations
Decimal3,124,301
Binary101111101011000100110122 bits
Octal13726115
Hexadecimal2FAC4D
Base 361UYQ5
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, one hundred and twenty-four thousand, three hundred and one
Ordinalthree million, one hundred and twenty-four thousand, three hundred and first
Scientific notation3.124301 × 10^6
Engineering notation3.124301 × 10^6
In other bases
Ternary12212201201212base 3; the most digit-efficient integer base after e: 14 digits
Quinary1244434201base 5; one hand: 10 digits
Septenary35361515base 7: 8 digits
Nonary5781655base 9; each digit is two ternary digits: 7 digits
Duodecimal1068065base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimaljaaf1base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal14:27:51:41base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T00T0T1TT1T0TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11100001111110001011101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001011111010110001001101
Bit length22 bitsto write the magnitude
Set bits13the population count, or Hamming weight
Zero bits9within that length
Bit parityodd13 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
Bytes32f ac 4d
Gray code1110000111101001101011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001011111010110001001101
64-bit0000000000000000000000000000000000000000001011111010110001001101
One's complement11111111110100000101001110110010at 32 bits, every bit flipped
Bits reversed10110010001101011111010000000000at 32 bits
Rotated left by 100000000010111110101100010011010at 32 bits, wrapping
Shifted left by 110111110101100010011010= 6,248,602, no wrap
Shifted right by 1101111101011000100110= 1,562,150, discarding the low bit
These bits as a double1.54360979 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,124,301 to the power 29,761,256,738,601
3,124,301 to the power 330,497,104,189,667,842,901
3,124,301 to the power 495,282,133,116,883,431,243,437,201
3,124,301 to the power 5297,690,063,779,212,021,117,302,090,521,501
First ten multiples3,124,301, 6,248,602, 9,372,903, 12,497,204, 15,621,505, 18,745,806, 21,870,107, 24,994,408, 28,118,709, 31,243,010
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 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 5
Divisible by 8No, remainder 5
Divisible by 9No, remainder 5
Divisible by 10No, remainder 1
Divisible by 11No, remainder 4
Divisible by 12No, remainder 5
Divisible by 100No, remainder 1
Collatz (3n + 1) trajectory
Steps to reach 1133the total stopping time
Highest value reached9,372,9043× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,124,301 → 9,372,904 → 4,686,452 → 2,343,226 → 1,171,613 → 3,514,840 → 1,757,420 → 878,710 → 439,355 → 1,318,066 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage312,430,100%
3,124,301% as a decimal31,243.01
3,124,301% of 1003,124,301
3,124,301% of 1,00031,243,010
As a fraction of 1003,124,301/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 3,124,301
Nerdulate something else
Nothing in mind? Surprise me · today’s page