Recognised as Number
1,237,828
- Positive
- Even
- Composite
- 7 digits
1,237,828 is an even 7-digit integer and a composite number. It has 6 divisors and a digital root of 4.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value1,237,828
Digit count7
Digit sum31
Digit product5,376
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2^2 × 309,457
Distinct prime factors22, 309,457
Number of divisors6
Sum of divisors σ(n)2,166,206
Aliquot sum928,378sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)618,912integers below n that share no factor with it
Carmichael function λ(n)309,456the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 618,912
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 309,457, 618,914, 1,237,8286 in total
Arithmetic
Previous number1,237,827
Next number1,237,829
Double2,475,656
Half618,914
Square1,532,218,157,584
Cube1,896,622,537,565,887,552
Square root1,112.577188333≈irrational, shown to 9 decimal places
Cube root107.370943016≈
Negation-1,237,828
Reciprocal8.07866683 × 10^-7≈
Representations
Decimal1,237,828
Binary10010111000110100010021 bits
Octal4561504
Hexadecimal12E344
Base 36QJ44
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, two hundred and thirty-seven thousand, eight hundred and twenty-eight
Ordinalone million, two hundred and thirty-seven thousand, eight hundred and twenty-eighth
Scientific notation1.237828 × 10^6
Engineering notation1.237828 × 10^6
In other bases
Ternary2022212222111base 3; the most digit-efficient integer base after e: 13 digits
Quinary304102303base 5; one hand: 9 digits
Septenary13343554base 7: 8 digits
Nonary2285874base 9; each digit is two ternary digits: 7 digits
Duodecimal4b8404base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal7eeb8base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal5:43:50:28base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1000T000T111digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101110010011101000100base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100101110001101000100
Bit length21 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits12within that length
Bit parityodd9 set bits, so odd; not the same as the number itself being even
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 22 trailing zeros
Power of twoNo
Bytes312 e3 44
Gray code110111001001011100110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100101110001101000100
64-bit0000000000000000000000000000000000000000000100101110001101000100
One's complement11111111111011010001110010111011at 32 bits, every bit flipped
Bits reversed00100010110001110100100000000000at 32 bits
Rotated left by 100000000001001011100011010001000at 32 bits, wrapping
Shifted left by 11001011100011010001000= 2,475,656, no wrap
Shifted right by 110010111000110100010= 618,914, discarding the low bit
These bits as a double6.1156829 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,237,828 to the power 21,532,218,157,584
1,237,828 to the power 31,896,622,537,565,887,552
1,237,828 to the power 42,347,692,482,430,107,456,717,056
1,237,828 to the power 52,906,039,490,141,495,052,933,159,994,368
First ten multiples1,237,828, 2,475,656, 3,713,484, 4,951,312, 6,189,140, 7,426,968, 8,664,796, 9,902,624, 11,140,452, 12,378,280
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 1
Divisible by 4Yes
Divisible by 5No, remainder 3
Divisible by 6No, remainder 4
Divisible by 7No, remainder 4
Divisible by 8No, remainder 4
Divisible by 9No, remainder 4
Divisible by 10No, remainder 8
Divisible by 11No, remainder 9
Divisible by 12No, remainder 4
Divisible by 100No, remainder 28
Collatz (3n + 1) trajectory
Steps to reach 180the total stopping time
Highest value reached1,237,828
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,237,828 → 618,914 → 309,457 → 928,372 → 464,186 → 232,093 → 696,280 → 348,140 → 174,070 → 87,035 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage123,782,800%
1,237,828% as a decimal12,378.28
1,237,828% of 1001,237,828
1,237,828% of 1,00012,378,280
As a fraction of 1001,237,828/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,237,828
Nerdulate something else
Nothing in mind? Surprise me · today’s page