Recognised as Number
1,399,871
- Positive
- Odd
- Composite
- 7 digits
1,399,871 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,399,871
Digit count7
Digit sum38
Digit product13,608
Multiplicative persistence2times 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 factorisation11 × 127,261
Distinct prime factors211, 127,261
Number of divisors4
Sum of divisors σ(n)1,527,144
Aliquot sum127,273sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,272,600integers below n that share no factor with it
Carmichael function λ(n)127,260the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,272,600
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 11, 127,261, 1,399,8714 in total
Arithmetic
Previous number1,399,870
Next number1,399,872
Double2,799,742
Half699,935.5
Square1,959,638,816,641
Cube2,743,241,549,890,053,311
Square root1,183.161442915≈irrational, shown to 9 decimal places
Cube root111.865458129≈
Negation-1,399,871
Reciprocal7.14351537 × 10^-7≈
Representations
Decimal1,399,871
Binary10101010111000011111121 bits
Octal5256077
Hexadecimal155C3F
Base 36U05B
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, three hundred and ninety-nine thousand, eight hundred and seventy-one
Ordinalone million, three hundred and ninety-nine thousand, eight hundred and seventy-first
Scientific notation1.399871 × 10^6
Engineering notation1.399871 × 10^6
In other bases
Ternary2122010021002base 3; the most digit-efficient integer base after e: 13 digits
Quinary324243441base 5; one hand: 9 digits
Septenary14620154base 7: 8 digits
Nonary2563232base 9; each digit is two ternary digits: 7 digits
Duodecimal57613bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal8ejdbbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal6:28:51:11base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10T0T0101T101Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11010101010110001000011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000101010101110000111111
Bit length21 bitsto write the magnitude
Set bits13the population count, or Hamming weight
Zero bits8within that length
Bit parityodd13 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
Bytes315 5c 3f
Gray code111111111001000100000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000101010101110000111111
64-bit0000000000000000000000000000000000000000000101010101110000111111
One's complement11111111111010101010001111000000at 32 bits, every bit flipped
Bits reversed11111100001110101010100000000000at 32 bits
Rotated left by 100000000001010101011100001111110at 32 bits, wrapping
Shifted left by 11010101011100001111110= 2,799,742, no wrap
Shifted right by 110101010111000011111= 699,935, discarding the low bit
These bits as a double6.9162817 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,399,871 to the power 21,959,638,816,641
1,399,871 to the power 32,743,241,549,890,053,311
1,399,871 to the power 43,840,184,291,686,138,818,522,881
1,399,871 to the power 55,375,762,624,586,966,834,024,443,948,351
First ten multiples1,399,871, 2,799,742, 4,199,613, 5,599,484, 6,999,355, 8,399,226, 9,799,097, 11,198,968, 12,598,839, 13,998,710
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 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 4
Divisible by 8No, remainder 7
Divisible by 9No, remainder 2
Divisible by 10No, remainder 1
Divisible by 11Yes
Divisible by 12No, remainder 11
Divisible by 100No, remainder 71
Collatz (3n + 1) trajectory
Steps to reach 1243the total stopping time
Highest value reached31,890,83222× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,399,871 → 4,199,614 → 2,099,807 → 6,299,422 → 3,149,711 → 9,449,134 → 4,724,567 → 14,173,702 → 7,086,851 → 21,260,554 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage139,987,100%
1,399,871% as a decimal13,998.71
1,399,871% of 1001,399,871
1,399,871% of 1,00013,998,710
As a fraction of 1001,399,871/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,399,871
Nerdulate something else
Nothing in mind? Surprise me · today’s page