Recognised as Number

1,384,741

Positive
Odd
Prime
7 digits

1,384,741 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 1.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value1,384,741

Digit count7

Digit sum28

Digit product2,688

Multiplicative persistence6times 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 factorisation1,384,741

Distinct prime factors11,384,741

Number of divisors2

Sum of divisors σ(n)1,384,742

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)1,384,740integers below n that share no factor with it

Carmichael function λ(n)1,384,740the 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,384,7412 in total

Arithmetic

Previous number1,384,740

Next number1,384,742

Double2,769,482

Half692,370.5

Square1,917,507,637,081

Cube2,655,251,442,879,181,021

Square root1,176.750185893≈irrational, shown to 9 decimal places

Cube root111.460978255≈

Negation-1,384,741

Reciprocal7.22156707 × 10^-7≈

Representations

Decimal1,384,741

Binary10101001000010010010121 bits

Octal5220445

Hexadecimal152125

Base 36TOH1

Roman numeralNot defined above 3,999there is no agreed standard notation

In wordsone million, three hundred and eighty-four thousand, seven hundred and forty-one

Ordinalone million, three hundred and eighty-four thousand, seven hundred and forty-first

Scientific notation1.384741 × 10^6

Engineering notation1.384741 × 10^6

In other bases

Ternary2121100111201base 3; the most digit-efficient integer base after e: 13 digits

Quinary323302431base 5; one hand: 9 digits

Septenary14525101base 7: 8 digits

Nonary2540451base 9; each digit is two ternary digits: 7 digits

Duodecimal569431base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits

Vigesimal8d1h1base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits

Sexagesimal6:24:39:1base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

Balanced ternary10TT1101TTTT01digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed

Negabinary101010110000101100101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000000101010010000100100101

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 21 25

Gray code111111011000110110111n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000000101010010000100100101

64-bit0000000000000000000000000000000000000000000101010010000100100101

One's complement11111111111010101101111011011010at 32 bits, every bit flipped

Bits reversed10100100100001001010100000000000at 32 bits

Rotated left by 100000000001010100100001001001010at 32 bits, wrapping

Shifted left by 11010100100001001001010= 2,769,482, no wrap

Shifted right by 110101001000010010010= 692,370, discarding the low bit

These bits as a double6.84152956 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime1,384,781+40

Previous prime1,384,727−14

Distance to nearest prime0, it is prime

Nearest square below1,382,976

Nearest square above1,385,329

Powers & multiples

1,384,741 to the power 21,917,507,637,081

1,384,741 to the power 32,655,251,442,879,181,021

1,384,741 to the power 43,676,835,538,263,960,006,200,561

1,384,741 to the power 55,091,464,920,091,174,242,946,171,039,701

First ten multiples1,384,741, 2,769,482, 4,154,223, 5,538,964, 6,923,705, 8,308,446, 9,693,187, 11,077,928, 12,462,669, 13,847,410

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 1

Divisible by 6No, remainder 1

Divisible by 7No, remainder 1

Divisible by 8No, remainder 5

Divisible by 9No, remainder 1

Divisible by 10No, remainder 1

Divisible by 11No, remainder 6

Divisible by 12No, remainder 1

Divisible by 100No, remainder 41

Collatz (3n + 1) trajectory

Steps to reach 1186the total stopping time

Highest value reached7,994,2125× the starting value

Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven

First steps1,384,741 → 4,154,224 → 2,077,112 → 1,038,556 → 519,278 → 259,639 → 778,918 → 389,459 → 1,168,378 → 584,189 → …

Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage138,474,100%

1,384,741% as a decimal13,847.41

1,384,741% of 1001,384,741

1,384,741% of 1,00013,847,410

As a fraction of 1001,384,741/100

Read another way

As seconds16 days, 39 minutes and 1 second

As bytes1.321 MiB

As a 24-bit colour#152125

Keep nerding

Every link below is a page Nerdulator can generate from what it already knows about this value.