Nerdulator> put something in

Recognised as Number

71,005

  • Positive
  • Odd
  • Composite
  • 5 digits

71,005 is an odd 5-digit integer and a composite number. It has 8 divisors and a digital root of 4.

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value71,005
Digit count5
Digit sum13
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation5 × 11 × 1,291
Distinct prime factors35, 11, 1,291
Number of divisors8
Sum of divisors σ(n)93,024
Aliquot sum22,019sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)51,600integers below n that share no factor with it
Carmichael function λ(n)2,580the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 51,600
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 5, 11, 55, 1,291, 6,455, 14,201, 71,0058 in total

Arithmetic

Previous number71,004
Next number71,006
Double142,010
Square root266.467634057≈irrational, shown to 9 decimal places
Cube root41.409149494≈
Negation-71,005
Reciprocal0.0000140835≈

Representations

Decimal71,005
Binary1000101010101110117 bits
Octal212535
Hexadecimal1155D
Base 361ISD
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsseventy-one thousand and five
Ordinalseventy-one thousand and fifth
Scientific notation7.1005 × 10^4
Engineering notation71.005 × 10^3

In other bases

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

Bit-level

00000000000000010001010101011101
Bit length17 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits8within that length
Bit parityodd9 set bits, so odd; 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 5d
Gray code11001111111110011n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000000000010001010101011101
64-bit0000000000000000000000000000000000000000000000010001010101011101
One's complement11111111111111101110101010100010at 32 bits, every bit flipped
Bits reversed10111010101010001000000000000000at 32 bits
Rotated left by 100000000000000100010101010111010at 32 bits, wrapping
Shifted left by 1100010101010111010= 142,010, no wrap
Shifted right by 11000101010101110= 35,502, discarding the low bit
These bits as a double3.50811312 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime71,011+6
Previous prime70,999−6
Distance to nearest prime6
Nearest square below70,756
Nearest square above71,289

Powers & multiples

71,005 to the power 25,041,710,025
71,005 to the power 3357,986,620,325,125
71,005 to the power 425,418,839,976,185,500,625
71,005 to the power 51,804,864,732,509,051,471,878,125
First ten multiples71,005, 142,010, 213,015, 284,020, 355,025, 426,030, 497,035, 568,040, 639,045, 710,050
Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)

Divisibility tests

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

Collatz (3n + 1) trajectory

Steps to reach 199the total stopping time
Highest value reached213,0163× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps71,005 → 213,016 → 106,508 → 53,254 → 26,627 → 79,882 → 39,941 → 119,824 → 59,912 → 29,956 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage7,100,500%
71,005% as a decimal710.05
71,005% of 10071,005
71,005% of 1,000710,050
As a fraction of 10071,005/100

Read another way

As bytes69.341 KiB
As a 24-bit colour#01155D

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