Recognised as Number
1,259,521
- Positive
- Odd
- Composite
- 7 digits
1,259,521 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,259,521
Digit count7
Digit sum25
Digit product900
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicYesreads the same backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation827 × 1,523
Distinct prime factors2827, 1,523
Number of divisors4
Sum of divisors σ(n)1,261,872
Aliquot sum2,351sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,257,172integers below n that share no factor with it
Carmichael function λ(n)628,586the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,257,172
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 827, 1,523, 1,259,5214 in total
Arithmetic
Previous number1,259,520
Next number1,259,522
Double2,519,042
Half629,760.5
Square1,586,393,149,441
Cube1,998,095,485,977,077,761
Square root1,122.283832192≈irrational, shown to 9 decimal places
Cube root107.994541334≈
Negation-1,259,521
Reciprocal7.93952622 × 10^-7≈
Representations
Decimal1,259,521
Binary10011001110000000000121 bits
Octal4634001
Hexadecimal133801
Base 36QZUP
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, two hundred and fifty-nine thousand, five hundred and twenty-one
Ordinalone million, two hundred and fifty-nine thousand, five hundred and twenty-first
Scientific notation1.259521 × 10^6
Engineering notation1.259521 × 10^6
In other bases
Ternary2100222201221base 3; the most digit-efficient integer base after e: 13 digits
Quinary310301041base 5; one hand: 9 digits
Septenary13464034base 7: 8 digits
Nonary2328657base 9; each digit is two ternary digits: 7 digits
Duodecimal508a81base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal7h8g1base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal5:49:52:1base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T101000T1T0T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101110100100000000001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100110011100000000001
Bit length21 bitsto write the magnitude
Set bits7the population count, or Hamming weight
Zero bits14within that length
Bit parityodd7 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
Bytes313 38 01
Gray code110101010010000000001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100110011100000000001
64-bit0000000000000000000000000000000000000000000100110011100000000001
One's complement11111111111011001100011111111110at 32 bits, every bit flipped
Bits reversed10000000000111001100100000000000at 32 bits
Rotated left by 100000000001001100111000000000010at 32 bits, wrapping
Shifted left by 11001100111000000000010= 2,519,042, no wrap
Shifted right by 110011001110000000000= 629,760, discarding the low bit
These bits as a double6.22286056 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,259,521 to the power 21,586,393,149,441
1,259,521 to the power 31,998,095,485,977,077,761
1,259,521 to the power 42,516,643,224,593,334,958,612,481
1,259,521 to the power 53,169,764,990,883,021,840,406,550,681,601
First ten multiples1,259,521, 2,519,042, 3,778,563, 5,038,084, 6,297,605, 7,557,126, 8,816,647, 10,076,168, 11,335,689, 12,595,210
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 1
Divisible by 4No, remainder 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 1
Divisible by 7No, remainder 4
Divisible by 8No, remainder 1
Divisible by 9No, remainder 7
Divisible by 10No, remainder 1
Divisible by 11No, remainder 10
Divisible by 12No, remainder 1
Divisible by 100No, remainder 21
Collatz (3n + 1) trajectory
Steps to reach 1129the total stopping time
Highest value reached3,778,5643× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,259,521 → 3,778,564 → 1,889,282 → 944,641 → 2,833,924 → 1,416,962 → 708,481 → 2,125,444 → 1,062,722 → 531,361 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage125,952,100%
1,259,521% as a decimal12,595.21
1,259,521% of 1001,259,521
1,259,521% of 1,00012,595,210
As a fraction of 1001,259,521/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,259,521
Nerdulate something else
Nothing in mind? Surprise me · today’s page