Nerdulator> put something in

Recognised as Number

71,001

  • Positive
  • Odd
  • Composite
  • 5 digits

71,001 is an odd 5-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 value71,001
Digit count5
Digit sum9
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 numberYesdivisible by its own digit sum

Factors & divisors

Prime factorisation3^2 × 7^3 × 23
Distinct prime factors33, 7, 23
Number of divisors24
Sum of divisors σ(n)124,800
Aliquot sum53,799sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)38,808integers below n that share no factor with it
Carmichael function λ(n)3,234the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 38,808
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 3, 7, 9, 21, 23, 49, 63, 69, 147, 161, 207, 343, 441, 483, 1,029, 1,127, 1,449, 3,087, 3,381, 7,889, 10,143, 23,667, 71,00124 in total

Arithmetic

Previous number71,000
Next number71,002
Double142,002
Square root266.460128349≈irrational, shown to 9 decimal places
Cube root41.408371898≈
Negation-71,001
Reciprocal0.0000140843≈

Representations

Decimal71,001
Binary1000101010101100117 bits
Octal212531
Hexadecimal11559
Base 361IS9
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsseventy-one thousand and one
Ordinalseventy-one thousand and first
Scientific notation7.1001 × 10^4
Engineering notation71.001 × 10^3

In other bases

Ternary10121101200base 3; the most digit-efficient integer base after e: 11 digits
Quinary4233001base 5; one hand: 7 digits
Septenary414000base 7: 6 digits
Nonary117350base 9; each digit is two ternary digits: 6 digits
Duodecimal35109base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal8ha1base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal19:43:21base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary11TT111TT00digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10110101010101001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000000000010001010101011001
Bit length17 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits9within that length
Bit parityeven8 set bits, so even; not the same as the number itself being odd
Highest set bitbit 16worth 65,536
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes301 15 59
Gray code11001111111110101n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000000000010001010101011001
64-bit0000000000000000000000000000000000000000000000010001010101011001
One's complement11111111111111101110101010100110at 32 bits, every bit flipped
Bits reversed10011010101010001000000000000000at 32 bits
Rotated left by 100000000000000100010101010110010at 32 bits, wrapping
Shifted left by 1100010101010110010= 142,002, no wrap
Shifted right by 11000101010101100= 35,500, discarding the low bit
These bits as a double3.50791549 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime71,011+10
Previous prime70,999−2
Distance to nearest prime2
Nearest square below70,756
Nearest square above71,289

Powers & multiples

71,001 to the power 25,041,142,001
71,001 to the power 3357,926,123,213,001
71,001 to the power 425,413,112,674,246,284,001
71,001 to the power 51,804,356,412,984,160,410,355,001
First ten multiples71,001, 142,002, 213,003, 284,004, 355,005, 426,006, 497,007, 568,008, 639,009, 710,010
Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)

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 1218the total stopping time
Highest value reached239,6323× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps71,001 → 213,004 → 106,502 → 53,251 → 159,754 → 79,877 → 239,632 → 119,816 → 59,908 → 29,954 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage7,100,100%
71,001% as a decimal710.01
71,001% of 10071,001
71,001% of 1,000710,010
As a fraction of 10071,001/100

Read another way

As bytes69.337 KiB
As a 24-bit colour#011559

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 “71001” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.