Recognised as Number
1,248,245
- Positive
- Odd
- Composite
- 7 digits
1,248,245 is an odd 7-digit integer and a composite number. It has 8 divisors and a digital root of 8.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,248,245
Digit count7
Digit sum26
Digit product2,560
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation5 × 41 × 6,089
Distinct prime factors35, 41, 6,089
Number of divisors8
Sum of divisors σ(n)1,534,680
Aliquot sum286,435sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)974,080integers below n that share no factor with it
Carmichael function λ(n)30,440the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 974,080
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 5, 41, 205, 6,089, 30,445, 249,649, 1,248,2458 in total
Arithmetic
Previous number1,248,244
Next number1,248,246
Double2,496,490
Half624,122.5
Square1,558,115,580,025
Cube1,944,909,982,188,306,125
Square root1,117.24885321≈irrational, shown to 9 decimal places
Cube root107.671297118≈
Negation-1,248,245
Reciprocal8.01124779 × 10^-7≈
Representations
Decimal1,248,245
Binary10011000010111111010121 bits
Octal4605765
Hexadecimal130BF5
Base 36QR5H
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, two hundred and forty-eight thousand, two hundred and forty-five
Ordinalone million, two hundred and forty-eight thousand, two hundred and forty-fifth
Scientific notation1.248245 × 10^6
Engineering notation1.248245 × 10^6
In other bases
Ternary2100102021022base 3; the most digit-efficient integer base after e: 13 digits
Quinary304420440base 5; one hand: 9 digits
Septenary13416125base 7: 8 digits
Nonary2312238base 9; each digit is two ternary digits: 7 digits
Duodecimal502445base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal7g0c5base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal5:46:44:5base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T10011T1T110Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101110001110000110101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100110000101111110101
Bit length21 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits9within that length
Bit parityeven12 set bits, so even; 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 0b f5
Gray code110101000111000001111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100110000101111110101
64-bit0000000000000000000000000000000000000000000100110000101111110101
One's complement11111111111011001111010000001010at 32 bits, every bit flipped
Bits reversed10101111110100001100100000000000at 32 bits
Rotated left by 100000000001001100001011111101010at 32 bits, wrapping
Shifted left by 11001100001011111101010= 2,496,490, no wrap
Shifted right by 110011000010111111010= 624,122, discarding the low bit
These bits as a double6.16714972 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,248,245 to the power 21,558,115,580,025
1,248,245 to the power 31,944,909,982,188,306,125
1,248,245 to the power 42,427,724,160,716,642,179,000,625
1,248,245 to the power 53,030,394,544,993,745,016,726,635,153,125
First ten multiples1,248,245, 2,496,490, 3,744,735, 4,992,980, 6,241,225, 7,489,470, 8,737,715, 9,985,960, 11,234,205, 12,482,450
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 1
Divisible by 5Yes
Divisible by 6No, remainder 5
Divisible by 7No, remainder 5
Divisible by 8No, remainder 5
Divisible by 9No, remainder 8
Divisible by 10No, remainder 5
Divisible by 11No, remainder 9
Divisible by 12No, remainder 5
Divisible by 100No, remainder 45
Collatz (3n + 1) trajectory
Steps to reach 1160the total stopping time
Highest value reached3,744,7363× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,248,245 → 3,744,736 → 1,872,368 → 936,184 → 468,092 → 234,046 → 117,023 → 351,070 → 175,535 → 526,606 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage124,824,500%
1,248,245% as a decimal12,482.45
1,248,245% of 1001,248,245
1,248,245% of 1,00012,482,450
As a fraction of 1001,248,245/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,248,245
Nerdulate something else
Nothing in mind? Surprise me · today’s page