Recognised as Number
1,117,431
- Positive
- Odd
- Composite
- 7 digits
1,117,431 is an odd 7-digit integer and a composite number. It has 12 divisors and a digital root of 9.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,117,431
Digit count7
Digit sum18
Digit product84
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3^2 × 7 × 17,737
Distinct prime factors33, 7, 17,737
Number of divisors12
Sum of divisors σ(n)1,844,752
Aliquot sum727,321sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)638,496integers below n that share no factor with it
Carmichael function λ(n)17,736the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 638,496
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 3, 7, 9, 21, 63, 17,737, 53,211, 124,159, 159,633, 372,477, 1,117,43112 in total
Arithmetic
Previous number1,117,430
Next number1,117,432
Double2,234,862
Half558,715.5
Square1,248,652,039,761
Cube1,395,282,497,442,173,991
Square root1,057.086089209≈irrational, shown to 9 decimal places
Cube root103.770419361≈
Negation-1,117,431
Reciprocal8.94909842 × 10^-7≈
Representations
Decimal1,117,431
Binary10001000011001111011121 bits
Octal4206367
Hexadecimal110CF7
Base 36NY7R
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, one hundred and seventeen thousand, four hundred and thirty-one
Ordinalone million, one hundred and seventeen thousand, four hundred and thirty-first
Scientific notation1.117431 × 10^6
Engineering notation1.117431 × 10^6
In other bases
Ternary2002202211100base 3; the most digit-efficient integer base after e: 13 digits
Quinary241224211base 5; one hand: 9 digits
Septenary12332550base 7: 8 digits
Nonary2082740base 9; each digit is two ternary digits: 7 digits
Duodecimal45a7b3base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal6jdbbbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal5:10:23:51base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T010T10T11100digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100010001110100001011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100010000110011110111
Bit length21 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits10within that length
Bit parityodd11 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
Bytes311 0c f7
Gray code110011000101010001100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100010000110011110111
64-bit0000000000000000000000000000000000000000000100010000110011110111
One's complement11111111111011101111001100001000at 32 bits, every bit flipped
Bits reversed11101111001100001000100000000000at 32 bits
Rotated left by 100000000001000100001100111101110at 32 bits, wrapping
Shifted left by 11000100001100111101110= 2,234,862, no wrap
Shifted right by 110001000011001111011= 558,715, discarding the low bit
These bits as a double5.52084269 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,117,431 to the power 21,248,652,039,761
1,117,431 to the power 31,395,282,497,442,173,991
1,117,431 to the power 41,559,131,916,399,305,924,937,121
1,117,431 to the power 51,742,222,336,473,992,819,008,412,056,151
First ten multiples1,117,431, 2,234,862, 3,352,293, 4,469,724, 5,587,155, 6,704,586, 7,822,017, 8,939,448, 10,056,879, 11,174,310
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 3
Divisible by 5No, remainder 1
Divisible by 6No, remainder 3
Divisible by 7Yes
Divisible by 8No, remainder 7
Divisible by 9Yes
Divisible by 10No, remainder 1
Divisible by 11No, remainder 7
Divisible by 12No, remainder 3
Divisible by 100No, remainder 31
Collatz (3n + 1) trajectory
Steps to reach 185the total stopping time
Highest value reached7,542,6646× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,117,431 → 3,352,294 → 1,676,147 → 5,028,442 → 2,514,221 → 7,542,664 → 3,771,332 → 1,885,666 → 942,833 → 2,828,500 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage111,743,100%
1,117,431% as a decimal11,174.31
1,117,431% of 1001,117,431
1,117,431% of 1,00011,174,310
As a fraction of 1001,117,431/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,117,431
Nerdulate something else
Nothing in mind? Surprise me · today’s page