Recognised as Number
71,999
- Positive
- Odd
- Prime
- 5 digits
71,999 is an odd 5-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 value71,999
Digit count5
Digit sum35
Digit product5,103
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation71,999
Distinct prime factors171,999
Number of divisors2
Sum of divisors σ(n)72,000
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)71,998integers below n that share no factor with it
Carmichael function λ(n)71,998the 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, 71,9992 in total
Arithmetic
Representations
Decimal71,999
Binary1000110010011111117 bits
Octal214477
Hexadecimal1193F
Base 361JJZ
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsseventy-one thousand, nine hundred and ninety-nine
Ordinalseventy-one thousand, nine hundred and ninety-ninth
Scientific notation7.1999 × 10^4
Engineering notation71.999 × 10^3
In other bases
Ternary10122202122base 3; the most digit-efficient integer base after e: 11 digits
Quinary4300444base 5; one hand: 7 digits
Septenary416624base 7: 6 digits
Nonary118678base 9; each digit is two ternary digits: 6 digits
Duodecimal357bbbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal8jjjbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal19:59:59base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary11T00T10T0Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10110100101000011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000000010001100100111111
Bit length17 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits7within that length
Bit parityeven10 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 19 3f
Gray code11001010110100000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000000010001100100111111
64-bit0000000000000000000000000000000000000000000000010001100100111111
One's complement11111111111111101110011011000000at 32 bits, every bit flipped
Bits reversed11111100100110001000000000000000at 32 bits
Rotated left by 100000000000000100011001001111110at 32 bits, wrapping
Shifted left by 1100011001001111110= 143,998, no wrap
Shifted right by 11000110010011111= 35,999, discarding the low bit
These bits as a double3.55722324 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
71,999 to the power 25,183,856,001
71,999 to the power 3373,232,448,215,999
71,999 to the power 426,872,363,039,103,712,001
71,999 to the power 51,934,783,266,452,428,160,359,999
First ten multiples71,999, 143,998, 215,997, 287,996, 359,995, 431,994, 503,993, 575,992, 647,991, 719,990
Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 2
Divisible by 4No, remainder 3
Divisible by 5No, remainder 4
Divisible by 6No, remainder 5
Divisible by 7No, remainder 4
Divisible by 8No, remainder 7
Divisible by 9No, remainder 8
Divisible by 10No, remainder 9
Divisible by 11No, remainder 4
Divisible by 12No, remainder 11
Divisible by 100No, remainder 99
Collatz (3n + 1) trajectory
Steps to reach 194the total stopping time
Highest value reached2,335,44432× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps71,999 → 215,998 → 107,999 → 323,998 → 161,999 → 485,998 → 242,999 → 728,998 → 364,499 → 1,093,498 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage7,199,900%
71,999% as a decimal719.99
71,999% of 10071,999
71,999% of 1,000719,990
As a fraction of 10071,999/100
Read another way
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from 71,999
Nerdulate something else
Nothing in mind? Surprise me · today’s page