Recognised as Number
1,379,335
- Positive
- Odd
- Composite
- 7 digits
1,379,335 is an odd 7-digit integer and a composite number. It has 8 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,379,335
Digit count7
Digit sum31
Digit product8,505
Multiplicative persistence2times 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 factorisation5 × 73 × 3,779
Distinct prime factors35, 73, 3,779
Number of divisors8
Sum of divisors σ(n)1,678,320
Aliquot sum298,985sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,088,064integers below n that share no factor with it
Carmichael function λ(n)136,008the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,088,064
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 5, 73, 365, 3,779, 18,895, 275,867, 1,379,3358 in total
Arithmetic
Previous number1,379,334
Next number1,379,336
Double2,758,670
Half689,667.5
Square1,902,565,042,225
Cube2,624,274,552,517,420,375
Square root1,174.450935544≈irrational, shown to 9 decimal places
Cube root111.315741979≈
Negation-1,379,335
Reciprocal7.24987041 × 10^-7≈
Representations
Decimal1,379,335
Binary10101000011000000011121 bits
Octal5206007
Hexadecimal150C07
Base 36TKAV
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, three hundred and seventy-nine thousand, three hundred and thirty-five
Ordinalone million, three hundred and seventy-nine thousand, three hundred and thirty-fifth
Scientific notation1.379335 × 10^6
Engineering notation1.379335 × 10^6
In other bases
Ternary2121002002111base 3; the most digit-efficient integer base after e: 13 digits
Quinary323114320base 5; one hand: 9 digits
Septenary14503246base 7: 8 digits
Nonary2532074base 9; each digit is two ternary digits: 7 digits
Duodecimal566287base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal8c86fbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal6:23:8:55base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10TT101T01T111digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101010001110000011011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000101010000110000000111
Bit length21 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits13within that length
Bit parityeven8 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
Bytes315 0c 07
Gray code111111000101000000100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000101010000110000000111
64-bit0000000000000000000000000000000000000000000101010000110000000111
One's complement11111111111010101111001111111000at 32 bits, every bit flipped
Bits reversed11100000001100001010100000000000at 32 bits
Rotated left by 100000000001010100001100000001110at 32 bits, wrapping
Shifted left by 11010100001100000001110= 2,758,670, no wrap
Shifted right by 110101000011000000011= 689,667, discarding the low bit
These bits as a double6.81482038 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,379,335 to the power 21,902,565,042,225
1,379,335 to the power 32,624,274,552,517,420,375
1,379,335 to the power 43,619,753,739,896,616,032,950,625
1,379,335 to the power 54,992,853,024,820,298,875,809,950,334,375
First ten multiples1,379,335, 2,758,670, 4,138,005, 5,517,340, 6,896,675, 8,276,010, 9,655,345, 11,034,680, 12,414,015, 13,793,350
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 3
Divisible by 5Yes
Divisible by 6No, remainder 1
Divisible by 7No, remainder 6
Divisible by 8No, remainder 7
Divisible by 9No, remainder 4
Divisible by 10No, remainder 5
Divisible by 11No, remainder 1
Divisible by 12No, remainder 7
Divisible by 100No, remainder 35
Collatz (3n + 1) trajectory
Steps to reach 1137the total stopping time
Highest value reached9,310,5166× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,379,335 → 4,138,006 → 2,069,003 → 6,207,010 → 3,103,505 → 9,310,516 → 4,655,258 → 2,327,629 → 6,982,888 → 3,491,444 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage137,933,500%
1,379,335% as a decimal13,793.35
1,379,335% of 1001,379,335
1,379,335% of 1,00013,793,350
As a fraction of 1001,379,335/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,379,335
Nerdulate something else
Nothing in mind? Surprise me · today’s page