Recognised as Number
1,384,493
- Positive
- Odd
- Composite
- 7 digits
1,384,493 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 5.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,384,493
Digit count7
Digit sum32
Digit product10,368
Multiplicative persistence2times 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 factorisation11 × 125,863
Distinct prime factors211, 125,863
Number of divisors4
Sum of divisors σ(n)1,510,368
Aliquot sum125,875sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,258,620integers below n that share no factor with it
Carmichael function λ(n)629,310the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,258,620
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 11, 125,863, 1,384,4934 in total
Arithmetic
Previous number1,384,492
Next number1,384,494
Double2,768,986
Half692,246.5
Square1,916,820,867,049
Cube2,653,825,072,683,271,157
Square root1,176.644806218≈irrational, shown to 9 decimal places
Cube root111.454323828≈
Negation-1,384,493
Reciprocal7.22286064 × 10^-7≈
Representations
Decimal1,384,493
Binary10101001000000010110121 bits
Octal5220055
Hexadecimal15202D
Base 36TOA5
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, three hundred and eighty-four thousand, four hundred and ninety-three
Ordinalone million, three hundred and eighty-four thousand, four hundred and ninety-third
Scientific notation1.384493 × 10^6
Engineering notation1.384493 × 10^6
In other bases
Ternary2121100011112base 3; the most digit-efficient integer base after e: 13 digits
Quinary323300433base 5; one hand: 9 digits
Septenary14524265base 7: 8 digits
Nonary2540145base 9; each digit is two ternary digits: 7 digits
Duodecimal569265base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal8d14dbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal6:24:34:53base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10TT11001TTTTTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101010110000001111101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000101010010000000101101
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 20 2d
Gray code111111011000000111011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000101010010000000101101
64-bit0000000000000000000000000000000000000000000101010010000000101101
One's complement11111111111010101101111111010010at 32 bits, every bit flipped
Bits reversed10110100000001001010100000000000at 32 bits
Rotated left by 100000000001010100100000001011010at 32 bits, wrapping
Shifted left by 11010100100000001011010= 2,768,986, no wrap
Shifted right by 110101001000000010110= 692,246, discarding the low bit
These bits as a double6.84030428 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,384,493 to the power 21,916,820,867,049
1,384,493 to the power 32,653,825,072,683,271,157
1,384,493 to the power 43,674,202,236,354,480,133,968,401
1,384,493 to the power 55,086,907,276,817,123,264,118,313,405,693
First ten multiples1,384,493, 2,768,986, 4,153,479, 5,537,972, 6,922,465, 8,306,958, 9,691,451, 11,075,944, 12,460,437, 13,844,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 7No, remainder 5
Divisible by 8No, remainder 5
Divisible by 9No, remainder 5
Divisible by 10No, remainder 3
Divisible by 11Yes
Divisible by 12No, remainder 5
Divisible by 100No, remainder 93
Collatz (3n + 1) trajectory
Steps to reach 1168the total stopping time
Highest value reached4,153,4803× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,384,493 → 4,153,480 → 2,076,740 → 1,038,370 → 519,185 → 1,557,556 → 778,778 → 389,389 → 1,168,168 → 584,084 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage138,449,300%
1,384,493% as a decimal13,844.93
1,384,493% of 1001,384,493
1,384,493% of 1,00013,844,930
As a fraction of 1001,384,493/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,384,493
Nerdulate something else
Nothing in mind? Surprise me · today’s page