Recognised as Number

76,013

Positive
Odd
Composite
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value76,013

Digit count5

Digit sum17

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 factorisation7 × 10,859

Distinct prime factors27, 10,859

Number of divisors4

Sum of divisors σ(n)86,880

Aliquot sum10,867sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)65,148integers below n that share no factor with it

Carmichael function λ(n)32,574the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 65,148

Möbius function μ(n)+12 distinct prime factors, an even number of them

SquarefreeYesno repeated prime factor

All divisors1, 7, 10,859, 76,0134 in total

Arithmetic

Previous number76,012

Next number76,014

Double152,026

Half38,006.5

Square5,777,976,169

Cube439,201,302,534,197

Square root275.704552012≈irrational, shown to 9 decimal places

Cube root42.360650867≈

Negation-76,013

Reciprocal0.0000131556≈

Representations

Decimal76,013

Binary1001010001110110117 bits

Octal224355

Hexadecimal128ED

Base 361MNH

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

In wordsseventy-six thousand and thirteen

Ordinalseventy-six thousand and thirteenth

Scientific notation7.6013 × 10^4

Engineering notation76.013 × 10^3

In other bases

Ternary10212021022base 3; the most digit-efficient integer base after e: 11 digits

Quinary4413023base 5; one hand: 7 digits

Septenary434420base 7: 6 digits

Nonary125238base 9; each digit is two ternary digits: 6 digits

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

Vigesimal9a0dbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits

Sexagesimal21:6:53base 60; Babylonian, and still how an hour and a circle are divided: 3 digits

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

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

Bit-level

00000000000000010010100011101101

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 28 ed

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

At each machine width

32-bit00000000000000010010100011101101

64-bit0000000000000000000000000000000000000000000000010010100011101101

One's complement11111111111111101101011100010010at 32 bits, every bit flipped

Bits reversed10110111000101001000000000000000at 32 bits

Rotated left by 100000000000000100101000111011010at 32 bits, wrapping

Shifted left by 1100101000111011010= 152,026, no wrap

Shifted right by 11001010001110110= 38,006, discarding the low bit

These bits as a double3.75554119 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime76,031+18

Previous prime76,003−10

Distance to nearest prime10

Nearest square below75,625

Nearest square above76,176

Powers & multiples

76,013 to the power 25,777,976,169

76,013 to the power 3439,201,302,534,197

76,013 to the power 433,385,008,609,531,916,561

76,013 to the power 52,537,694,659,436,349,573,551,293

First ten multiples76,013, 152,026, 228,039, 304,052, 380,065, 456,078, 532,091, 608,104, 684,117, 760,130

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 1

Divisible by 5No, remainder 3

Divisible by 6No, remainder 5

Divisible by 7Yes

Divisible by 8No, remainder 5

Divisible by 9No, remainder 8

Divisible by 10No, remainder 3

Divisible by 11No, remainder 3

Divisible by 12No, remainder 5

Divisible by 100No, remainder 13

Collatz (3n + 1) trajectory

Steps to reach 1156the total stopping time

Highest value reached228,0403× the starting value

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

First steps76,013 → 228,040 → 114,020 → 57,010 → 28,505 → 85,516 → 42,758 → 21,379 → 64,138 → 32,069 → …

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

As a percentage & fraction

As a percentage7,601,300%

76,013% as a decimal760.13

76,013% of 10076,013

76,013% of 1,000760,130

As a fraction of 10076,013/100

Read another way

As seconds21 hours, 6 minutes and 53 seconds

As bytes74.231 KiB

As a 24-bit colour#0128ED

Keep nerding

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