Recognised as Number
1,090,379
- Positive
- Odd
- Composite
- 7 digits
1,090,379 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 2.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,090,379
Digit count7
Digit sum29
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation59 × 18,481
Distinct prime factors259, 18,481
Number of divisors4
Sum of divisors σ(n)1,108,920
Aliquot sum18,541sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,071,840integers below n that share no factor with it
Carmichael function λ(n)535,920the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,071,840
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 59, 18,481, 1,090,3794 in total
Arithmetic
Previous number1,090,378
Next number1,090,380
Double2,180,758
Half545,189.5
Square1,188,926,363,641
Cube1,296,380,339,460,509,939
Square root1,044.212143197≈irrational, shown to 9 decimal places
Cube root102.926173256≈
Negation-1,090,379
Reciprocal9.17112307 × 10^-7≈
Representations
Decimal1,090,379
Binary10000101000110100101121 bits
Octal4121513
Hexadecimal10A34B
Base 36NDCB
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, ninety thousand, three hundred and seventy-nine
Ordinalone million, ninety thousand, three hundred and seventy-ninth
Scientific notation1.090379 × 10^6
Engineering notation1.090379 × 10^6
In other bases
Ternary2001101201102base 3; the most digit-efficient integer base after e: 13 digits
Quinary234343004base 5; one hand: 9 digits
Septenary12160643base 7: 8 digits
Nonary2041642base 9; each digit is two ternary digits: 7 digits
Duodecimal44700bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal6g5ijbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal5:2:52:59base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T00111TT0111Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100011110011101011111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100001010001101001011
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 odd
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes310 a3 4b
Gray code110001111001011101110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100001010001101001011
64-bit0000000000000000000000000000000000000000000100001010001101001011
One's complement11111111111011110101110010110100at 32 bits, every bit flipped
Bits reversed11010010110001010000100000000000at 32 bits
Rotated left by 100000000001000010100011010010110at 32 bits, wrapping
Shifted left by 11000010100011010010110= 2,180,758, no wrap
Shifted right by 110000101000110100101= 545,189, discarding the low bit
These bits as a double5.38718805 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,090,379 to the power 21,188,926,363,641
1,090,379 to the power 31,296,380,339,460,509,939
1,090,379 to the power 41,413,545,898,160,611,366,776,881
1,090,379 to the power 51,541,300,762,890,469,261,494,808,727,899
First ten multiples1,090,379, 2,180,758, 3,271,137, 4,361,516, 5,451,895, 6,542,274, 7,632,653, 8,723,032, 9,813,411, 10,903,790
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 4
Divisible by 6No, remainder 5
Divisible by 7No, remainder 3
Divisible by 8No, remainder 3
Divisible by 9No, remainder 2
Divisible by 10No, remainder 9
Divisible by 11No, remainder 4
Divisible by 12No, remainder 11
Divisible by 100No, remainder 79
Collatz (3n + 1) trajectory
Steps to reach 1209the total stopping time
Highest value reached4,906,7084× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,090,379 → 3,271,138 → 1,635,569 → 4,906,708 → 2,453,354 → 1,226,677 → 3,680,032 → 1,840,016 → 920,008 → 460,004 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage109,037,900%
1,090,379% as a decimal10,903.79
1,090,379% of 1001,090,379
1,090,379% of 1,00010,903,790
As a fraction of 1001,090,379/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,090,379
Nerdulate something else
Nothing in mind? Surprise me · today’s page