Recognised as Number
1,241,531
- Positive
- Odd
- Composite
- 7 digits
1,241,531 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 8.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,241,531
Digit count7
Digit sum17
Digit product120
Multiplicative persistence2times 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 factorisation113 × 10,987
Distinct prime factors2113, 10,987
Number of divisors4
Sum of divisors σ(n)1,252,632
Aliquot sum11,101sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,230,432integers below n that share no factor with it
Carmichael function λ(n)615,216the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,230,432
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 113, 10,987, 1,241,5314 in total
Arithmetic
Previous number1,241,530
Next number1,241,532
Double2,483,062
Half620,765.5
Square1,541,399,223,961
Cube1,913,694,919,923,524,291
Square root1,114.240099799≈irrational, shown to 9 decimal places
Cube root107.477904238≈
Negation-1,241,531
Reciprocal8.05457133 × 10^-7≈
Representations
Decimal1,241,531
Binary10010111100011011101121 bits
Octal4570673
Hexadecimal12F1BB
Base 36QLYZ
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, two hundred and forty-one thousand, five hundred and thirty-one
Ordinalone million, two hundred and forty-one thousand, five hundred and thirty-first
Scientific notation1.241531 × 10^6
Engineering notation1.241531 × 10^6
In other bases
Ternary2100002001122base 3; the most digit-efficient integer base after e: 13 digits
Quinary304212111base 5; one hand: 9 digits
Septenary13360424base 7: 8 digits
Nonary2302048base 9; each digit is two ternary digits: 7 digits
Duodecimal4ba58bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal7f3gbbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal5:44:52:11base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T10001T01TT0Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101110011011011001111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100101111000110111011
Bit length21 bitsto write the magnitude
Set bits13the population count, or Hamming weight
Zero bits8within that length
Bit parityodd13 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes312 f1 bb
Gray code110111000100101100110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100101111000110111011
64-bit0000000000000000000000000000000000000000000100101111000110111011
One's complement11111111111011010000111001000100at 32 bits, every bit flipped
Bits reversed11011101100011110100100000000000at 32 bits
Rotated left by 100000000001001011110001101110110at 32 bits, wrapping
Shifted left by 11001011110001101110110= 2,483,062, no wrap
Shifted right by 110010111100011011101= 620,765, discarding the low bit
These bits as a double6.13397815 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,241,531 to the power 21,541,399,223,961
1,241,531 to the power 31,913,694,919,923,524,291
1,241,531 to the power 42,375,911,567,627,573,036,529,521
1,241,531 to the power 52,949,767,864,468,228,379,615,532,736,651
First ten multiples1,241,531, 2,483,062, 3,724,593, 4,966,124, 6,207,655, 7,449,186, 8,690,717, 9,932,248, 11,173,779, 12,415,310
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
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 4
Divisible by 8No, remainder 3
Divisible by 9No, remainder 8
Divisible by 10No, remainder 1
Divisible by 11No, remainder 5
Divisible by 12No, remainder 11
Divisible by 100No, remainder 31
Collatz (3n + 1) trajectory
Steps to reach 1186the total stopping time
Highest value reached6,285,2565× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,241,531 → 3,724,594 → 1,862,297 → 5,586,892 → 2,793,446 → 1,396,723 → 4,190,170 → 2,095,085 → 6,285,256 → 3,142,628 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage124,153,100%
1,241,531% as a decimal12,415.31
1,241,531% of 1001,241,531
1,241,531% of 1,00012,415,310
As a fraction of 1001,241,531/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 1,241,531
Nerdulate something else
Nothing in mind? Surprise me · today’s page