Recognised as Number
1,274,347
- Positive
- Odd
- Composite
- 7 digits
1,274,347 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,274,347
Digit count7
Digit sum28
Digit product4,704
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 factorisation29 × 43,943
Distinct prime factors229, 43,943
Number of divisors4
Sum of divisors σ(n)1,318,320
Aliquot sum43,973sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,230,376integers below n that share no factor with it
Carmichael function λ(n)615,188the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,230,376
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 29, 43,943, 1,274,3474 in total
Arithmetic
Previous number1,274,346
Next number1,274,348
Double2,548,694
Half637,173.5
Square1,623,960,276,409
Cube2,069,488,906,360,979,923
Square root1,128.869788771≈irrational, shown to 9 decimal places
Cube root108.416629167≈
Negation-1,274,347
Reciprocal7.84715623 × 10^-7≈
Representations
Decimal1,274,347
Binary10011011100011110101121 bits
Octal4670753
Hexadecimal1371EB
Base 36RBAJ
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, two hundred and seventy-four thousand, three hundred and forty-seven
Ordinalone million, two hundred and seventy-four thousand, three hundred and forty-seventh
Scientific notation1.274347 × 10^6
Engineering notation1.274347 × 10^6
In other bases
Ternary2101202002001base 3; the most digit-efficient integer base after e: 13 digits
Quinary311234342base 5; one hand: 9 digits
Septenary13555204base 7: 8 digits
Nonary2352061base 9; each digit is two ternary digits: 7 digits
Duodecimal515577base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal7j5h7base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal5:53:59:7base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T11TT1T01T001digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101001011011000111111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100110111000111101011
Bit length21 bitsto write the magnitude
Set bits13the population count, or Hamming weight
Zero bits8within that length
Bit parityodd13 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
Bytes313 71 eb
Gray code110101100100100011110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100110111000111101011
64-bit0000000000000000000000000000000000000000000100110111000111101011
One's complement11111111111011001000111000010100at 32 bits, every bit flipped
Bits reversed11010111100011101100100000000000at 32 bits
Rotated left by 100000000001001101110001111010110at 32 bits, wrapping
Shifted left by 11001101110001111010110= 2,548,694, no wrap
Shifted right by 110011011100011110101= 637,173, discarding the low bit
These bits as a double6.29611074 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,274,347 to the power 21,623,960,276,409
1,274,347 to the power 32,069,488,906,360,979,923
1,274,347 to the power 42,637,246,979,354,395,681,935,281
1,274,347 to the power 53,360,767,776,399,336,074,087,179,536,507
First ten multiples1,274,347, 2,548,694, 3,823,041, 5,097,388, 6,371,735, 7,646,082, 8,920,429, 10,194,776, 11,469,123, 12,743,470
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 3
Divisible by 5No, remainder 2
Divisible by 6No, remainder 1
Divisible by 7No, remainder 4
Divisible by 8No, remainder 3
Divisible by 9No, remainder 1
Divisible by 10No, remainder 7
Divisible by 11No, remainder 8
Divisible by 12No, remainder 7
Divisible by 100No, remainder 47
Collatz (3n + 1) trajectory
Steps to reach 1204the total stopping time
Highest value reached16,330,08412× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,274,347 → 3,823,042 → 1,911,521 → 5,734,564 → 2,867,282 → 1,433,641 → 4,300,924 → 2,150,462 → 1,075,231 → 3,225,694 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage127,434,700%
1,274,347% as a decimal12,743.47
1,274,347% of 1001,274,347
1,274,347% of 1,00012,743,470
As a fraction of 1001,274,347/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,274,347
Nerdulate something else
Nothing in mind? Surprise me · today’s page