Recognised as Number
1,408,397
- Positive
- Odd
- Prime
- 7 digits
1,408,397 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 5.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value1,408,397
Digit count7
Digit sum32
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation1,408,397
Distinct prime factors11,408,397
Number of divisors2
Sum of divisors σ(n)1,408,398
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,408,396integers below n that share no factor with it
Carmichael function λ(n)1,408,396the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)−11 distinct prime factor, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 1,408,3972 in total
Arithmetic
Previous number1,408,396
Next number1,408,398
Double2,816,794
Half704,198.5
Square1,983,582,109,609
Cube2,793,671,092,426,986,773
Square root1,186.759031986≈irrational, shown to 9 decimal places
Cube root112.092106418≈
Negation-1,408,397
Reciprocal7.10027073 × 10^-7≈
Representations
Decimal1,408,397
Binary10101011111011000110121 bits
Octal5276615
Hexadecimal157D8D
Base 36U6Q5
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, four hundred and eight thousand, three hundred and ninety-seven
Ordinalone million, four hundred and eight thousand, three hundred and ninety-seventh
Scientific notation1.408397 × 10^6
Engineering notation1.408397 × 10^6
In other bases
Ternary2122112221212base 3; the most digit-efficient integer base after e: 13 digits
Quinary330032042base 5; one hand: 9 digits
Septenary14654054base 7: 8 digits
Nonary2575855base 9; each digit is two ternary digits: 7 digits
Duodecimal57b065base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal8g0jhbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal6:31:13:17base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10T00TT000T0TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11010101000001010011101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000101010111110110001101
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 7d 8d
Gray code111111100001101001011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000101010111110110001101
64-bit0000000000000000000000000000000000000000000101010111110110001101
One's complement11111111111010101000001001110010at 32 bits, every bit flipped
Bits reversed10110001101111101010100000000000at 32 bits
Rotated left by 100000000001010101111101100011010at 32 bits, wrapping
Shifted left by 11010101111101100011010= 2,816,794, no wrap
Shifted right by 110101011111011000110= 704,198, discarding the low bit
These bits as a double6.95840573 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,408,397 to the power 21,983,582,109,609
1,408,397 to the power 32,793,671,092,426,986,773
1,408,397 to the power 43,934,597,985,560,890,890,132,881
1,408,397 to the power 55,541,475,999,070,002,046,990,479,201,757
First ten multiples1,408,397, 2,816,794, 4,225,191, 5,633,588, 7,041,985, 8,450,382, 9,858,779, 11,267,176, 12,675,573, 14,083,970
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 5No, remainder 2
Divisible by 6No, remainder 5
Divisible by 7No, remainder 4
Divisible by 8No, remainder 5
Divisible by 9No, remainder 5
Divisible by 10No, remainder 7
Divisible by 11No, remainder 1
Divisible by 12No, remainder 5
Divisible by 100No, remainder 97
Collatz (3n + 1) trajectory
Steps to reach 149the total stopping time
Highest value reached4,225,1923× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,408,397 → 4,225,192 → 2,112,596 → 1,056,298 → 528,149 → 1,584,448 → 792,224 → 396,112 → 198,056 → 99,028 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage140,839,700%
1,408,397% as a decimal14,083.97
1,408,397% of 1001,408,397
1,408,397% of 1,00014,083,970
As a fraction of 1001,408,397/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,408,397
Nerdulate something else
Nothing in mind? Surprise me · today’s page