Recognised as Number
1,393,237
- Positive
- Odd
- Composite
- 7 digits
1,393,237 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,393,237
Digit count7
Digit sum28
Digit product3,402
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation821 × 1,697
Distinct prime factors2821, 1,697
Number of divisors4
Sum of divisors σ(n)1,395,756
Aliquot sum2,519sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,390,720integers below n that share no factor with it
Carmichael function λ(n)347,680the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,390,720
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 821, 1,697, 1,393,2374 in total
Arithmetic
Previous number1,393,236
Next number1,393,238
Double2,786,474
Half696,618.5
Square1,941,109,338,169
Cube2,704,425,350,982,563,053
Square root1,180.354607734≈irrational, shown to 9 decimal places
Cube root111.688467811≈
Negation-1,393,237
Reciprocal7.17752974 × 10^-7≈
Representations
Decimal1,393,237
Binary10101010000100101010121 bits
Octal5241125
Hexadecimal154255
Base 36TV11
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, three hundred and ninety-three thousand, two hundred and thirty-seven
Ordinalone million, three hundred and ninety-three thousand, two hundred and thirty-seventh
Scientific notation1.393237 × 10^6
Engineering notation1.393237 × 10^6
In other bases
Ternary2121210011101base 3; the most digit-efficient integer base after e: 13 digits
Quinary324040422base 5; one hand: 9 digits
Septenary14561626base 7: 8 digits
Nonary2553141base 9; each digit is two ternary digits: 7 digits
Duodecimal572331base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal8e31hbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal6:27:0:37base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10T0TT10011101digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101010100011001010101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000101010100001001010101
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
Bytes315 42 55
Gray code111111110001101111111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000101010100001001010101
64-bit0000000000000000000000000000000000000000000101010100001001010101
One's complement11111111111010101011110110101010at 32 bits, every bit flipped
Bits reversed10101010010000101010100000000000at 32 bits
Rotated left by 100000000001010101000010010101010at 32 bits, wrapping
Shifted left by 11010101000010010101010= 2,786,474, no wrap
Shifted right by 110101010000100101010= 696,618, discarding the low bit
These bits as a double6.88350538 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,393,237 to the power 21,941,109,338,169
1,393,237 to the power 32,704,425,350,982,563,053
1,393,237 to the power 43,767,905,462,726,893,200,272,561
1,393,237 to the power 55,249,585,303,173,228,501,668,142,069,957
First ten multiples1,393,237, 2,786,474, 4,179,711, 5,572,948, 6,966,185, 8,359,422, 9,752,659, 11,145,896, 12,539,133, 13,932,370
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 1
Divisible by 5No, remainder 2
Divisible by 6No, remainder 1
Divisible by 7No, remainder 6
Divisible by 8No, remainder 5
Divisible by 9No, remainder 1
Divisible by 10No, remainder 7
Divisible by 11No, remainder 10
Divisible by 12No, remainder 1
Divisible by 100No, remainder 37
Collatz (3n + 1) trajectory
Steps to reach 1199the total stopping time
Highest value reached4,179,7123× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,393,237 → 4,179,712 → 2,089,856 → 1,044,928 → 522,464 → 261,232 → 130,616 → 65,308 → 32,654 → 16,327 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage139,323,700%
1,393,237% as a decimal13,932.37
1,393,237% of 1001,393,237
1,393,237% of 1,00013,932,370
As a fraction of 1001,393,237/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,393,237
Nerdulate something else
Nothing in mind? Surprise me · today’s page