Recognised as Number
1,494,261
- Positive
- Odd
- Composite
- 7 digits
1,494,261 is an odd 7-digit integer and a composite number. It has 8 divisors and a digital root of 9.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,494,261
Digit count7
Digit sum27
Digit product1,728
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberYesdivisible by its own digit sum
Factors & divisors
Prime factorisation3^3 × 55,343
Distinct prime factors23, 55,343
Number of divisors8
Sum of divisors σ(n)2,213,760
Aliquot sum719,499sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)996,156integers below n that share no factor with it
Carmichael function λ(n)498,078the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 996,156
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 3, 9, 27, 55,343, 166,029, 498,087, 1,494,2618 in total
Arithmetic
Previous number1,494,260
Next number1,494,262
Double2,988,522
Half747,130.5
Square2,232,815,936,121
Cube3,336,409,773,524,101,581
Square root1,222.399689136≈irrational, shown to 9 decimal places
Cube root114.325248451≈
Negation-1,494,261
Reciprocal6.6922713 × 10^-7≈
Representations
Decimal1,494,261
Binary10110110011001111010121 bits
Octal5546365
Hexadecimal16CCF5
Base 36W0Z9
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, four hundred and ninety-four thousand, two hundred and sixty-one
Ordinalone million, four hundred and ninety-four thousand, two hundred and sixty-first
Scientific notation1.494261 × 10^6
Engineering notation1.494261 × 10^6
In other bases
Ternary2210220202000base 3; the most digit-efficient integer base after e: 13 digits
Quinary340304021base 5; one hand: 9 digits
Septenary15462306base 7: 8 digits
Nonary2726660base 9; each digit is two ternary digits: 7 digits
Duodecimal600899base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal96fd1base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal6:55:4:21base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10T110T1T1T000digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11010111101110100110101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000101101100110011110101
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
Bytes316 cc f5
Gray code111011010101010001111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000101101100110011110101
64-bit0000000000000000000000000000000000000000000101101100110011110101
One's complement11111111111010010011001100001010at 32 bits, every bit flipped
Bits reversed10101111001100110110100000000000at 32 bits
Rotated left by 100000000001011011001100111101010at 32 bits, wrapping
Shifted left by 11011011001100111101010= 2,988,522, no wrap
Shifted right by 110110110011001111010= 747,130, discarding the low bit
These bits as a double7.38263026 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,494,261 to the power 22,232,815,936,121
1,494,261 to the power 33,336,409,773,524,101,581
1,494,261 to the power 44,985,467,004,595,897,552,526,641
1,494,261 to the power 57,449,588,911,754,470,472,736,011,107,301
First ten multiples1,494,261, 2,988,522, 4,482,783, 5,977,044, 7,471,305, 8,965,566, 10,459,827, 11,954,088, 13,448,349, 14,942,610
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 3
Divisible by 7No, remainder 6
Divisible by 8No, remainder 5
Divisible by 9Yes
Divisible by 10No, remainder 1
Divisible by 11No, remainder 10
Divisible by 12No, remainder 9
Divisible by 100No, remainder 61
Collatz (3n + 1) trajectory
Steps to reach 1137the total stopping time
Highest value reached4,482,7843× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,494,261 → 4,482,784 → 2,241,392 → 1,120,696 → 560,348 → 280,174 → 140,087 → 420,262 → 210,131 → 630,394 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage149,426,100%
1,494,261% as a decimal14,942.61
1,494,261% of 1001,494,261
1,494,261% of 1,00014,942,610
As a fraction of 1001,494,261/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,494,261
Nerdulate something else
Nothing in mind? Surprise me · today’s page