Recognised as Number

27,290

Positive
Even
Composite
5 digits

27,290 is an even 5-digit integer and a composite number. It has 8 divisors and a digital root of 2.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value27,290

Digit count5

Digit sum20

Digit product0zero, because one of the digits is zero

Multiplicative persistence1times the digit product can be taken before one digit is left

Digital root2repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 5 × 2,729

Distinct prime factors32, 5, 2,729

Number of divisors8

Sum of divisors σ(n)49,140

Aliquot sum21,850sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)2,728the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 10,912

Möbius function μ(n)−13 distinct prime factors, an odd number of them

SquarefreeYesno repeated prime factor

All divisors1, 2, 5, 10, 2,729, 5,458, 13,645, 27,2908 in total

Arithmetic

Previous number27,289

Next number27,291

Double54,580

Half13,645

Square744,744,100

Cube20,324,066,489,000

Square root165.19685227≈irrational, shown to 9 decimal places

Cube root30.107025141≈

Negation-27,290

Reciprocal0.0000366435≈

Representations

Decimal27,290

Binary11010101001101015 bits

Octal65232

Hexadecimal6A9A

Base 36L22

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

In wordstwenty-seven thousand, two hundred and ninety

Ordinaltwenty-seven thousand, two hundred and ninetieth

Scientific notation2.729 × 10^4

Engineering notation27.29 × 10^3

In other bases

Ternary1101102202base 3; the most digit-efficient integer base after e: 10 digits

Quinary1333130base 5; one hand: 7 digits

Septenary142364base 7: 6 digits

Nonary41382base 9; each digit is two ternary digits: 5 digits

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

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

Sexagesimal7:34:50base 60; Babylonian, and still how an hour and a circle are divided: 3 digits

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

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

Bit-level

0110101010011010

Bit length15 bitsto write the magnitude

Set bits8the population count, or Hamming weight

Zero bits7within that length

Bit parityeven8 set bits, so even; not the same as the number itself being even

Highest set bitbit 14worth 16,384

Lowest set bitbit 11 trailing zero

Power of twoNo

Bytes26a 9a

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

At each machine width

16-bit0110101010011010

32-bit00000000000000000110101010011010

64-bit0000000000000000000000000000000000000000000000000110101010011010

One's complement1001010101100101at 16 bits, every bit flipped

Bits reversed0101100101010110at 16 bits

Rotated left by 11101010100110100at 16 bits, wrapping

Shifted left by 11101010100110100= 54,580, no wrap

Shifted right by 111010101001101= 13,645, discarding the low bit

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

Nearest landmarks

Next prime27,299+9

Previous prime27,283−7

Distance to nearest prime7

Nearest square below27,225

Nearest square above27,556

Powers & multiples

27,290 to the power 2744,744,100

27,290 to the power 320,324,066,489,000

27,290 to the power 4554,643,774,484,810,000

27,290 to the power 515,136,228,605,690,464,900,000

First ten multiples27,290, 54,580, 81,870, 109,160, 136,450, 163,740, 191,030, 218,320, 245,610, 272,900

Powers of twoBetween 2^14 (16,384) and 2^15 (32,768)

Divisibility tests

Divisible by 2Yes

Divisible by 3No, remainder 2

Divisible by 4No, remainder 2

Divisible by 5Yes

Divisible by 6No, remainder 2

Divisible by 7No, remainder 4

Divisible by 8No, remainder 2

Divisible by 9No, remainder 2

Divisible by 10Yes

Divisible by 11No, remainder 10

Divisible by 12No, remainder 2

Divisible by 100No, remainder 90

Collatz (3n + 1) trajectory

Steps to reach 1139the total stopping time

Highest value reached65,6082× the starting value

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

First steps27,290 → 13,645 → 40,936 → 20,468 → 10,234 → 5,117 → 15,352 → 7,676 → 3,838 → 1,919 → …

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

As a percentage & fraction

As a percentage2,729,000%

27,290% as a decimal272.9

27,290% of 10027,290

27,290% of 1,000272,900

As a fraction of 10027,290/100

Read another way

As seconds7 hours, 34 minutes and 50 seconds

As bytes26.65 KiB

As a 24-bit colour#006A9A

Keep nerding

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