Recognised as Number

1,052,229

Positive
Odd
Composite
7 digits

1,052,229 is an odd 7-digit integer and a composite number. It has 8 divisors and a digital root of 3.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value1,052,229

Digit count7

Digit sum21

Digit product0zero, because one of the digits is zero

Multiplicative persistence1times the digit product can be taken before one digit is left

Digital root3repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3 × 359 × 977

Distinct prime factors33, 359, 977

Number of divisors8

Sum of divisors σ(n)1,408,320

Aliquot sum356,091sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)698,816integers below n that share no factor with it

Carmichael function λ(n)174,704the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 698,816

Möbius function μ(n)−13 distinct prime factors, an odd number of them

SquarefreeYesno repeated prime factor

All divisors1, 3, 359, 977, 1,077, 2,931, 350,743, 1,052,2298 in total

Arithmetic

Previous number1,052,228

Next number1,052,230

Double2,104,458

Half526,114.5

Square1,107,185,868,441

Cube1,165,013,079,163,804,989

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

Cube root101.71150699≈

Negation-1,052,229

Reciprocal9.50363467 × 10^-7≈

Representations

Decimal1,052,229

Binary10000000011100100010121 bits

Octal4007105

Hexadecimal100E45

Base 36MJWL

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

In wordsone million, fifty-two thousand, two hundred and twenty-nine

Ordinalone million, fifty-two thousand, two hundred and twenty-ninth

Scientific notation1.052229 × 10^6

Engineering notation1.052229 × 10^6

In other bases

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

Quinary232132404base 5; one hand: 9 digits

Septenary11641503base 7: 8 digits

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

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

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

Sexagesimal4:52:17:9base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000000100000000111001000101

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 odd

Highest set bitbit 20worth 1,048,576

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes310 0e 45

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

At each machine width

32-bit00000000000100000000111001000101

64-bit0000000000000000000000000000000000000000000100000000111001000101

One's complement11111111111011111111000110111010at 32 bits, every bit flipped

Bits reversed10100010011100000000100000000000at 32 bits

Rotated left by 100000000001000000001110010001010at 32 bits, wrapping

Shifted left by 11000000001110010001010= 2,104,458, no wrap

Shifted right by 110000000011100100010= 526,114, discarding the low bit

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

Nearest landmarks

Next prime1,052,231+2

Previous prime1,052,221−8

Distance to nearest prime2

Nearest square below1,050,625

Nearest square above1,052,676

Powers & multiples

1,052,229 to the power 21,107,185,868,441

1,052,229 to the power 31,165,013,079,163,804,989

1,052,229 to the power 41,225,860,547,275,451,359,770,481

1,052,229 to the power 51,289,886,017,799,100,908,839,933,452,149

First ten multiples1,052,229, 2,104,458, 3,156,687, 4,208,916, 5,261,145, 6,313,374, 7,365,603, 8,417,832, 9,470,061, 10,522,290

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 4

Divisible by 6No, remainder 3

Divisible by 7No, remainder 3

Divisible by 8No, remainder 5

Divisible by 9No, remainder 3

Divisible by 10No, remainder 9

Divisible by 11No, remainder 2

Divisible by 12No, remainder 9

Divisible by 100No, remainder 29

Collatz (3n + 1) trajectory

Steps to reach 1165the total stopping time

Highest value reached3,156,6883× the starting value

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

First steps1,052,229 → 3,156,688 → 1,578,344 → 789,172 → 394,586 → 197,293 → 591,880 → 295,940 → 147,970 → 73,985 → …

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

As a percentage & fraction

As a percentage105,222,900%

1,052,229% as a decimal10,522.29

1,052,229% of 1001,052,229

1,052,229% of 1,00010,522,290

As a fraction of 1001,052,229/100

Read another way

As seconds12 days, 4 hours and 17 minutes

As bytes1.003 MiB

As a 24-bit colour#100E45

Keep nerding

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