Recognised as Number

1,274,941

Positive
Odd
Prime
7 digits

1,274,941 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,274,941

Digit count7

Digit sum28

Digit product2,016

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 factorisation1,274,941

Distinct prime factors11,274,941

Number of divisors2

Sum of divisors σ(n)1,274,942

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)1,274,940the 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,274,9412 in total

Arithmetic

Previous number1,274,940

Next number1,274,942

Double2,549,882

Half637,470.5

Square1,625,474,553,481

Cube2,072,384,152,689,619,621

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

Cube root108.433471642≈

Negation-1,274,941

Reciprocal7.84350021 × 10^-7≈

Representations

Decimal1,274,941

Binary10011011101000011110121 bits

Octal4672075

Hexadecimal13743D

Base 36RBR1

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

In wordsone million, two hundred and seventy-four thousand, nine hundred and forty-one

Ordinalone million, two hundred and seventy-four thousand, nine hundred and forty-first

Scientific notation1.274941 × 10^6

Engineering notation1.274941 × 10^6

In other bases

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

Quinary311244231base 5; one hand: 9 digits

Septenary13560013base 7: 8 digits

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

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

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

Sexagesimal5:54:9:1base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000000100110111010000111101

Bit length21 bitsto write the magnitude

Set bits12the population count, or Hamming weight

Zero bits9within that length

Bit parityeven12 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

Bytes313 74 3d

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

At each machine width

32-bit00000000000100110111010000111101

64-bit0000000000000000000000000000000000000000000100110111010000111101

One's complement11111111111011001000101111000010at 32 bits, every bit flipped

Bits reversed10111100001011101100100000000000at 32 bits

Rotated left by 100000000001001101110100001111010at 32 bits, wrapping

Shifted left by 11001101110100001111010= 2,549,882, no wrap

Shifted right by 110011011101000011110= 637,470, discarding the low bit

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

Nearest landmarks

Next prime1,274,989+48

Previous prime1,274,939−2

Distance to nearest prime0, it is prime

Nearest square below1,274,641

Nearest square above1,276,900

Powers & multiples

1,274,941 to the power 21,625,474,553,481

1,274,941 to the power 32,072,384,152,689,619,621

1,274,941 to the power 42,642,167,524,014,256,329,217,361

1,274,941 to the power 53,368,607,705,234,259,978,628,711,450,701

First ten multiples1,274,941, 2,549,882, 3,824,823, 5,099,764, 6,374,705, 7,649,646, 8,924,587, 10,199,528, 11,474,469, 12,749,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 3

Divisible by 8No, remainder 5

Divisible by 9No, remainder 1

Divisible by 10No, remainder 1

Divisible by 11No, remainder 8

Divisible by 12No, remainder 1

Divisible by 100No, remainder 41

Collatz (3n + 1) trajectory

Steps to reach 180the total stopping time

Highest value reached3,824,8243× the starting value

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

First steps1,274,941 → 3,824,824 → 1,912,412 → 956,206 → 478,103 → 1,434,310 → 717,155 → 2,151,466 → 1,075,733 → 3,227,200 → …

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

As a percentage & fraction

As a percentage127,494,100%

1,274,941% as a decimal12,749.41

1,274,941% of 1001,274,941

1,274,941% of 1,00012,749,410

As a fraction of 1001,274,941/100

Read another way

As seconds14 days, 18 hours and 9 minutes

As bytes1.216 MiB

As a 24-bit colour#13743D

Keep nerding

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