Recognised as Number
1,414,948
- Positive
- Even
- Composite
- 7 digits
1,414,948 is an even 7-digit integer and a composite number. It has 6 divisors and a digital root of 4.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value1,414,948
Digit count7
Digit sum31
Digit product4,608
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2^2 × 353,737
Distinct prime factors22, 353,737
Number of divisors6
Sum of divisors σ(n)2,476,166
Aliquot sum1,061,218sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)707,472integers below n that share no factor with it
Carmichael function λ(n)353,736the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 707,472
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 353,737, 707,474, 1,414,9486 in total
Arithmetic
Previous number1,414,947
Next number1,414,949
Double2,829,896
Half707,474
Square2,002,077,842,704
Cube2,832,836,039,378,339,392
Square root1,189.515867906≈irrational, shown to 9 decimal places
Cube root112.265632253≈
Negation-1,414,948
Reciprocal7.06739753 × 10^-7≈
Representations
Decimal1,414,948
Binary10101100101110010010021 bits
Octal5313444
Hexadecimal159724
Base 36UBS4
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, four hundred and fourteen thousand, nine hundred and forty-eight
Ordinalone million, four hundred and fourteen thousand, nine hundred and forty-eighth
Scientific notation1.414948 × 10^6
Engineering notation1.414948 × 10^6
In other bases
Ternary2122212221111base 3; the most digit-efficient integer base after e: 13 digits
Quinary330234243base 5; one hand: 9 digits
Septenary15012133base 7: 8 digits
Nonary2585844base 9; each digit is two ternary digits: 7 digits
Duodecimal582a04base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal8gh78base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal6:33:2:28base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10T000T00T1111digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11010101110101101100100base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000101011001011100100100
Bit length21 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits11within that length
Bit parityeven10 set bits, so even; not the same as the number itself being even
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 22 trailing zeros
Power of twoNo
Bytes315 97 24
Gray code111110101110010110110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000101011001011100100100
64-bit0000000000000000000000000000000000000000000101011001011100100100
One's complement11111111111010100110100011011011at 32 bits, every bit flipped
Bits reversed00100100111010011010100000000000at 32 bits
Rotated left by 100000000001010110010111001001000at 32 bits, wrapping
Shifted left by 11010110010111001001000= 2,829,896, no wrap
Shifted right by 110101100101110010010= 707,474, discarding the low bit
These bits as a double6.99077197 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,414,948 to the power 22,002,077,842,704
1,414,948 to the power 32,832,836,039,378,339,392
1,414,948 to the power 44,008,315,688,246,302,566,031,616
1,414,948 to the power 55,671,558,266,452,729,323,201,302,995,968
First ten multiples1,414,948, 2,829,896, 4,244,844, 5,659,792, 7,074,740, 8,489,688, 9,904,636, 11,319,584, 12,734,532, 14,149,480
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 1
Divisible by 4Yes
Divisible by 5No, remainder 3
Divisible by 6No, remainder 4
Divisible by 7No, remainder 3
Divisible by 8No, remainder 4
Divisible by 9No, remainder 4
Divisible by 10No, remainder 8
Divisible by 11No, remainder 7
Divisible by 12No, remainder 4
Divisible by 100No, remainder 48
Collatz (3n + 1) trajectory
Steps to reach 1124the total stopping time
Highest value reached1,790,8001× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,414,948 → 707,474 → 353,737 → 1,061,212 → 530,606 → 265,303 → 795,910 → 397,955 → 1,193,866 → 596,933 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage141,494,800%
1,414,948% as a decimal14,149.48
1,414,948% of 1001,414,948
1,414,948% of 1,00014,149,480
As a fraction of 1001,414,948/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,414,948
Nerdulate something else
Nothing in mind? Surprise me · today’s page