Recognised as Number
1,051,434
- Positive
- Even
- Composite
- 7 digits
1,051,434 is an even 7-digit integer and a composite number. It has 16 divisors and a digital root of 9.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value1,051,434
Digit count7
Digit sum18
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberYesdivisible by its own digit sum
Factors & divisors
Prime factorisation2 × 3^3 × 19,471
Distinct prime factors32, 3, 19,471
Number of divisors16
Sum of divisors σ(n)2,336,640
Aliquot sum1,285,206sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)350,460integers below n that share no factor with it
Carmichael function λ(n)58,410the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 350,460
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 3, 6, 9, 18, 27, 54, 19,471, 38,942, 58,413, 116,826, 175,239, 350,478, 525,717, 1,051,43416 in total
Arithmetic
Previous number1,051,433
Next number1,051,435
Double2,102,868
Half525,717
Square1,105,513,456,356
Cube1,162,374,435,470,214,504
Square root1,025.394558207≈irrational, shown to 9 decimal places
Cube root101.685884868≈
Negation-1,051,434
Reciprocal9.51082046 × 10^-7≈
Representations
Decimal1,051,434
Binary10000000010110010101021 bits
Octal4005452
Hexadecimal100B2A
Base 36MJAI
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, fifty-one thousand, four hundred and thirty-four
Ordinalone million, fifty-one thousand, four hundred and thirty-fourth
Scientific notation1.051434 × 10^6
Engineering notation1.051434 × 10^6
In other bases
Ternary1222102022000base 3; the most digit-efficient integer base after e: 13 digits
Quinary232121214base 5; one hand: 9 digits
Septenary11636256base 7: 8 digits
Nonary1872260base 9; each digit is two ternary digits: 7 digits
Duodecimal428576base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal6b8bebase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal4:52:3:54base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T00T11T10T000digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100000001111101111110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100000000101100101010
Bit length21 bitsto write the magnitude
Set bits7the population count, or Hamming weight
Zero bits14within that length
Bit parityodd7 set bits, so odd; not the same as the number itself being even
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes310 0b 2a
Gray code110000000111010111111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100000000101100101010
64-bit0000000000000000000000000000000000000000000100000000101100101010
One's complement11111111111011111111010011010101at 32 bits, every bit flipped
Bits reversed01010100110100000000100000000000at 32 bits
Rotated left by 100000000001000000001011001010100at 32 bits, wrapping
Shifted left by 11000000001011001010100= 2,102,868, no wrap
Shifted right by 110000000010110010101= 525,717, discarding the low bit
These bits as a double5.19477418 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,051,434 to the power 21,105,513,456,356
1,051,434 to the power 31,162,374,435,470,214,504
1,051,434 to the power 41,222,160,002,184,189,516,798,736
1,051,434 to the power 51,285,020,579,736,531,120,405,762,187,424
First ten multiples1,051,434, 2,102,868, 3,154,302, 4,205,736, 5,257,170, 6,308,604, 7,360,038, 8,411,472, 9,462,906, 10,514,340
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2Yes
Divisible by 3Yes
Divisible by 4No, remainder 2
Divisible by 5No, remainder 4
Divisible by 6Yes
Divisible by 7No, remainder 6
Divisible by 8No, remainder 2
Divisible by 9Yes
Divisible by 10No, remainder 4
Divisible by 11No, remainder 10
Divisible by 12No, remainder 6
Divisible by 100No, remainder 34
Collatz (3n + 1) trajectory
Steps to reach 1165the total stopping time
Highest value reached1,577,1521× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,051,434 → 525,717 → 1,577,152 → 788,576 → 394,288 → 197,144 → 98,572 → 49,286 → 24,643 → 73,930 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage105,143,400%
1,051,434% as a decimal10,514.34
1,051,434% of 1001,051,434
1,051,434% of 1,00010,514,340
As a fraction of 1001,051,434/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,051,434
Nerdulate something else
Nothing in mind? Surprise me · today’s page