Recognised as Number
1,398,593
- Positive
- Odd
- Composite
- 7 digits
1,398,593 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,398,593
Digit count7
Digit sum38
Digit product29,160
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 factorisation7 × 199,799
Distinct prime factors27, 199,799
Number of divisors4
Sum of divisors σ(n)1,598,400
Aliquot sum199,807sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,198,788integers below n that share no factor with it
Carmichael function λ(n)599,394the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,198,788
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 7, 199,799, 1,398,5934 in total
Arithmetic
Previous number1,398,592
Next number1,398,594
Double2,797,186
Half699,296.5
Square1,956,062,379,649
Cube2,735,735,151,740,433,857
Square root1,182.621241142≈irrational, shown to 9 decimal places
Cube root111.831405567≈
Negation-1,398,593
Reciprocal7.15004294 × 10^-7≈
Representations
Decimal1,398,593
Binary10101010101110100000121 bits
Octal5253501
Hexadecimal155741
Base 36TZ5T
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, three hundred and ninety-eight thousand, five hundred and ninety-three
Ordinalone million, three hundred and ninety-eight thousand, five hundred and ninety-third
Scientific notation1.398593 × 10^6
Engineering notation1.398593 × 10^6
In other bases
Ternary2122001111202base 3; the most digit-efficient integer base after e: 13 digits
Quinary324223333base 5; one hand: 9 digits
Septenary14613350base 7: 8 digits
Nonary2561452base 9; each digit is two ternary digits: 7 digits
Duodecimal575455base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal8eg9dbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal6:28:29:53base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10T0T01TTTTT1Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11010101010101101000001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000101010101011101000001
Bit length21 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits11within that length
Bit parityeven10 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 57 41
Gray code111111111110011100001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000101010101011101000001
64-bit0000000000000000000000000000000000000000000101010101011101000001
One's complement11111111111010101010100010111110at 32 bits, every bit flipped
Bits reversed10000010111010101010100000000000at 32 bits
Rotated left by 100000000001010101010111010000010at 32 bits, wrapping
Shifted left by 11010101010111010000010= 2,797,186, no wrap
Shifted right by 110101010101110100000= 699,296, discarding the low bit
These bits as a double6.90996754 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,398,593 to the power 21,956,062,379,649
1,398,593 to the power 32,735,735,151,740,433,857
1,398,593 to the power 43,826,180,033,078,108,609,363,201
1,398,593 to the power 55,351,268,611,002,811,154,295,107,376,193
First ten multiples1,398,593, 2,797,186, 4,195,779, 5,594,372, 6,992,965, 8,391,558, 9,790,151, 11,188,744, 12,587,337, 13,985,930
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 3
Divisible by 6No, remainder 5
Divisible by 7Yes
Divisible by 8No, remainder 1
Divisible by 9No, remainder 2
Divisible by 10No, remainder 3
Divisible by 11No, remainder 9
Divisible by 12No, remainder 5
Divisible by 100No, remainder 93
Collatz (3n + 1) trajectory
Steps to reach 162the total stopping time
Highest value reached4,195,7803× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,398,593 → 4,195,780 → 2,097,890 → 1,048,945 → 3,146,836 → 1,573,418 → 786,709 → 2,360,128 → 1,180,064 → 590,032 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage139,859,300%
1,398,593% as a decimal13,985.93
1,398,593% of 1001,398,593
1,398,593% of 1,00013,985,930
As a fraction of 1001,398,593/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,398,593
Nerdulate something else
Nothing in mind? Surprise me · today’s page