Nerdulator> put something in

Recognised as Number

79,482

  • Positive
  • Even
  • Composite
  • 5 digits

79,482 is an even 5-digit integer and a composite number. It has 16 divisors and a digital root of 3.

Number properties

ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value79,482
Digit count5
Digit sum30
Digit product4,032
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root3repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 3 × 13 × 1,019
Distinct prime factors42, 3, 13, 1,019
Number of divisors16
Sum of divisors σ(n)171,360
Aliquot sum91,878sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)24,432integers below n that share no factor with it
Carmichael function λ(n)6,108the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 24,432
Möbius function μ(n)+14 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 3, 6, 13, 26, 39, 78, 1,019, 2,038, 3,057, 6,114, 13,247, 26,494, 39,741, 79,48216 in total

Arithmetic

Previous number79,481
Next number79,483
Double158,964
Half39,741
Square root281.92552208≈irrational, shown to 9 decimal places
Cube root42.995492587≈
Negation-79,482
Reciprocal0.0000125815≈

Representations

Decimal79,482
Binary1001101100111101017 bits
Octal233172
Hexadecimal1367A
Base 361PBU
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsseventy-nine thousand, four hundred and eighty-two
Ordinalseventy-nine thousand, four hundred and eighty-second
Scientific notation7.9482 × 10^4
Engineering notation79.482 × 10^3

In other bases

Ternary11001000210base 3; the most digit-efficient integer base after e: 11 digits
Quinary10020412base 5; one hand: 8 digits
Septenary450504base 7: 6 digits
Nonary131023base 9; each digit is two ternary digits: 6 digits
Duodecimal39bb6base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal9ie2base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal22:4:42base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary11001001T10digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10100101110001110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000000000010011011001111010
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 even
Highest set bitbit 16worth 65,536
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes301 36 7a
Gray code11010110101000111n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000000000010011011001111010
64-bit0000000000000000000000000000000000000000000000010011011001111010
One's complement11111111111111101100100110000101at 32 bits, every bit flipped
Bits reversed01011110011011001000000000000000at 32 bits
Rotated left by 100000000000000100110110011110100at 32 bits, wrapping
Shifted left by 1100110110011110100= 158,964, no wrap
Shifted right by 11001101100111101= 39,741, discarding the low bit
These bits as a double3.92693257 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime79,493+11
Previous prime79,481−1
Distance to nearest prime1
Nearest square below78,961
Nearest square above79,524

Powers & multiples

79,482 to the power 26,317,388,324
79,482 to the power 3502,118,658,768,168
79,482 to the power 439,909,395,236,211,528,976
79,482 to the power 53,172,078,552,164,564,746,070,432
First ten multiples79,482, 158,964, 238,446, 317,928, 397,410, 476,892, 556,374, 635,856, 715,338, 794,820
Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)

Divisibility tests

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

Collatz (3n + 1) trajectory

Steps to reach 1169the total stopping time
Highest value reached190,9962× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps79,482 → 39,741 → 119,224 → 59,612 → 29,806 → 14,903 → 44,710 → 22,355 → 67,066 → 33,533 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage7,948,200%
79,482% as a decimal794.82
79,482% of 10079,482
79,482% of 1,000794,820
As a fraction of 10079,482/100

Read another way

As bytes77.619 KiB
As a 24-bit colour#01367A

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