Nerdulator> put something in

Recognised as Number

4,397,201

  • Positive
  • Odd
  • Prime
  • 7 digits

4,397,201 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 8.

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value4,397,201
Digit count7
Digit sum26
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation4,397,201
Distinct prime factors14,397,201
Number of divisors2
Sum of divisors σ(n)4,397,202
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)4,397,200integers below n that share no factor with it
Carmichael function λ(n)4,397,200the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)−11 distinct prime factor, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 4,397,2012 in total

Arithmetic

Previous number4,397,200
Next number4,397,202
Double8,794,402
Cube85,021,537,472,164,711,601
Square root2,096.950404754≈irrational, shown to 9 decimal places
Cube root163.829500079≈
Negation-4,397,201
Reciprocal2.27417396 × 10^-7≈

Representations

Decimal4,397,201
Binary1000011000110001001000123 bits
Octal20614221
Hexadecimal431891
Base 362M8WH
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfour million, three hundred and ninety-seven thousand, two hundred and one
Ordinalfour million, three hundred and ninety-seven thousand, two hundred and first
Scientific notation4.397201 × 10^6
Engineering notation4.397201 × 10^6

In other bases

Ternary22021101211022base 3; the most digit-efficient integer base after e: 14 digits
Quinary2111202301base 5; one hand: 10 digits
Septenary52242554base 7: 8 digits
Nonary8241738base 9; each digit is two ternary digits: 7 digits
Duodecimal1580815base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal179d01base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal20:21:26:41base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10T1T111TT1110Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10001110110100110010001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000010000110001100010010001
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
Bytes343 18 91
Gray code11000101001010011011001n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000010000110001100010010001
64-bit0000000000000000000000000000000000000000010000110001100010010001
One's complement11111111101111001110011101101110at 32 bits, every bit flipped
Bits reversed10001001000110001100001000000000at 32 bits
Rotated left by 100000000100001100011000100100010at 32 bits, wrapping
Shifted left by 1100001100011000100100010= 8,794,402, no wrap
Shifted right by 11000011000110001001000= 2,198,600, discarding the low bit
These bits as a double2.17250595 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime4,397,207+6
Previous prime4,397,177−24
Distance to nearest prime0, it is prime
Nearest square below4,393,216
Nearest square above4,397,409

Powers & multiples

4,397,201 to the power 219,335,376,634,401
4,397,201 to the power 385,021,537,472,164,711,601
4,397,201 to the power 4373,856,789,594,140,142,016,628,801
4,397,201 to the power 51,643,923,449,060,142,626,615,662,180,386,001
First ten multiples4,397,201, 8,794,402, 13,191,603, 17,588,804, 21,986,005, 26,383,206, 30,780,407, 35,177,608, 39,574,809, 43,972,010
Powers of twoBetween 2^22 (4,194,304) and 2^23 (8,388,608)

Divisibility tests

Divisible by 2No, remainder 1
Divisible by 3No, remainder 2
Divisible by 4No, remainder 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 4
Divisible by 8No, remainder 1
Divisible by 9No, remainder 8
Divisible by 10No, remainder 1
Divisible by 11No, remainder 6
Divisible by 12No, remainder 5
Divisible by 100No, remainder 1

Collatz (3n + 1) trajectory

Steps to reach 1211the total stopping time
Highest value reached13,191,6043× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps4,397,201 → 13,191,604 → 6,595,802 → 3,297,901 → 9,893,704 → 4,946,852 → 2,473,426 → 1,236,713 → 3,710,140 → 1,855,070 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage439,720,100%
4,397,201% as a decimal43,972.01
4,397,201% of 1004,397,201
4,397,201% of 1,00043,972,010
As a fraction of 1004,397,201/100

Read another way

As bytes4.193 MiB
As a 24-bit colour#431891

Keep nerding

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

Nerdulate something else

Nothing in mind? Surprise me · today’s page

Every value on this page was computed from “4397201” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.