Recognised as Number

4,229,001

Positive
Odd
Composite
7 digits

4,229,001 is an odd 7-digit integer and a composite number. It has 24 divisors and a digital root of 9.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value4,229,001

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 numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3^2 × 7 × 19 × 3,533

Distinct prime factors43, 7, 19, 3,533

Number of divisors24

Sum of divisors σ(n)7,350,720

Aliquot sum3,121,719sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)2,288,736integers below n that share no factor with it

Carmichael function λ(n)31,788the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,288,736

Möbius function μ(n)0zero, because a prime divides n twice

SquarefreeNohas a repeated prime factor

All divisors1, 3, 7, 9, 19, 21, 57, 63, 133, 171, 399, 1,197, 3,533, 10,599, 24,731, 31,797, 67,127, 74,193, 201,381, 222,579, 469,889, 604,143, 1,409,667, 4,229,00124 in total

Arithmetic

Previous number4,229,000

Next number4,229,002

Double8,458,002

Half2,114,500.5

Square17,884,449,458,001

Cube75,633,354,642,335,687,001

Square root2,056.453500568≈irrational, shown to 9 decimal places

Cube root161.713370619≈

Negation-4,229,001

Reciprocal2.36462465 × 10^-7≈

Representations

Decimal4,229,001

Binary1000000100001111000100123 bits

Octal20103611

Hexadecimal408789

Base 362IN49

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

In wordsfour million, two hundred and twenty-nine thousand and one

Ordinalfour million, two hundred and twenty-nine thousand and first

Scientific notation4.229001 × 10^6

Engineering notation4.229001 × 10^6

In other bases

Ternary21221212002200base 3; the most digit-efficient integer base after e: 14 digits

Quinary2040312001base 5; one hand: 10 digits

Septenary50642310base 7: 8 digits

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

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

Vigesimal168ca1base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits

Sexagesimal19:34:43:21base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000010000001000011110001001

Bit length23 bitsto write the magnitude

Set bits8the population count, or Hamming weight

Zero bits15within that length

Bit parityeven8 set bits, so even; not the same as the number itself being odd

Highest set bitbit 22worth 4,194,304

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes340 87 89

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

At each machine width

32-bit00000000010000001000011110001001

64-bit0000000000000000000000000000000000000000010000001000011110001001

One's complement11111111101111110111100001110110at 32 bits, every bit flipped

Bits reversed10010001111000010000001000000000at 32 bits

Rotated left by 100000000100000010000111100010010at 32 bits, wrapping

Shifted left by 1100000010000111100010010= 8,458,002, no wrap

Shifted right by 11000000100001111000100= 2,114,500, discarding the low bit

These bits as a double2.08940411 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime4,229,003+2

Previous prime4,228,993−8

Distance to nearest prime2

Nearest square below4,227,136

Nearest square above4,231,249

Powers & multiples

4,229,001 to the power 217,884,449,458,001

4,229,001 to the power 375,633,354,642,335,687,001

4,229,001 to the power 4319,853,532,415,792,262,662,916,001

4,229,001 to the power 51,352,660,908,439,917,894,593,734,431,145,001

First ten multiples4,229,001, 8,458,002, 12,687,003, 16,916,004, 21,145,005, 25,374,006, 29,603,007, 33,832,008, 38,061,009, 42,290,010

Powers of twoBetween 2^22 (4,194,304) and 2^23 (8,388,608)

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 7Yes

Divisible by 8No, remainder 1

Divisible by 9Yes

Divisible by 10No, remainder 1

Divisible by 11No, remainder 7

Divisible by 12No, remainder 9

Divisible by 100No, remainder 1

Collatz (3n + 1) trajectory

Steps to reach 1105the total stopping time

Highest value reached34,293,6168× the starting value

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

First steps4,229,001 → 12,687,004 → 6,343,502 → 3,171,751 → 9,515,254 → 4,757,627 → 14,272,882 → 7,136,441 → 21,409,324 → 10,704,662 → …

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

As a percentage & fraction

As a percentage422,900,100%

4,229,001% as a decimal42,290.01

4,229,001% of 1004,229,001

4,229,001% of 1,00042,290,010

As a fraction of 1004,229,001/100

Read another way

As seconds48 days, 22 hours and 43 minutes

As bytes4.033 MiB

As a 24-bit colour#408789

Keep nerding

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