Recognised as Number

29,210

Positive
Even
Composite
5 digits

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

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value29,210

Digit count5

Digit sum14

Digit product0zero, because one of the digits is zero

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

Digital root5repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 5 × 23 × 127

Distinct prime factors42, 5, 23, 127

Number of divisors16

Sum of divisors σ(n)55,296

Aliquot sum26,086sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

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

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

SquarefreeYesno repeated prime factor

All divisors1, 2, 5, 10, 23, 46, 115, 127, 230, 254, 635, 1,270, 2,921, 5,842, 14,605, 29,21016 in total

Arithmetic

Previous number29,209

Next number29,211

Double58,420

Half14,605

Square853,224,100

Cube24,922,675,961,000

Square root170.909332688≈irrational, shown to 9 decimal places

Cube root30.79714934≈

Negation-29,210

Reciprocal0.0000342349≈

Representations

Decimal29,210

Binary11100100001101015 bits

Octal71032

Hexadecimal721A

Base 36MJE

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

In wordstwenty-nine thousand, two hundred and ten

Ordinaltwenty-nine thousand, two hundred and tenth

Scientific notation2.921 × 10^4

Engineering notation29.21 × 10^3

In other bases

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

Quinary1413320base 5; one hand: 7 digits

Septenary151106base 7: 6 digits

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

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

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

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

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

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

Bit-level

0111001000011010

Bit length15 bitsto write the magnitude

Set bits7the population count, or Hamming weight

Zero bits8within that length

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

Highest set bitbit 14worth 16,384

Lowest set bitbit 11 trailing zero

Power of twoNo

Bytes272 1a

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

At each machine width

16-bit0111001000011010

32-bit00000000000000000111001000011010

64-bit0000000000000000000000000000000000000000000000000111001000011010

One's complement1000110111100101at 16 bits, every bit flipped

Bits reversed0101100001001110at 16 bits

Rotated left by 11110010000110100at 16 bits, wrapping

Shifted left by 11110010000110100= 58,420, no wrap

Shifted right by 111100100001101= 14,605, discarding the low bit

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

Nearest landmarks

Next prime29,221+11

Previous prime29,209−1

Distance to nearest prime1

Nearest square below28,900

Nearest square above29,241

Powers & multiples

29,210 to the power 2853,224,100

29,210 to the power 324,922,675,961,000

29,210 to the power 4727,991,364,820,810,000

29,210 to the power 521,264,627,766,415,860,100,000

First ten multiples29,210, 58,420, 87,630, 116,840, 146,050, 175,260, 204,470, 233,680, 262,890, 292,100

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 6

Divisible by 8No, remainder 2

Divisible by 9No, remainder 5

Divisible by 10Yes

Divisible by 11No, remainder 5

Divisible by 12No, remainder 2

Divisible by 100No, remainder 10

Collatz (3n + 1) trajectory

Steps to reach 146the total stopping time

Highest value reached43,8161× the starting value

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

First steps29,210 → 14,605 → 43,816 → 21,908 → 10,954 → 5,477 → 16,432 → 8,216 → 4,108 → 2,054 → …

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

As a percentage & fraction

As a percentage2,921,000%

29,210% as a decimal292.1

29,210% of 10029,210

29,210% of 1,000292,100

As a fraction of 10029,210/100

Read another way

As seconds8 hours, 6 minutes and 50 seconds

As bytes28.525 KiB

As a 24-bit colour#00721A

Keep nerding

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