Nerdulator> put something in

Recognised as Number

29,077

  • Positive
  • Odd
  • Prime
  • 5 digits

29,077 is an odd 5-digit integer and a prime number. It has 2 divisors and a digital root of 7.

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value29,077
Digit count5
Digit sum25
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation29,077
Distinct prime factors129,077
Number of divisors2
Sum of divisors σ(n)29,078
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)29,076integers below n that share no factor with it
Carmichael function λ(n)29,076the 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, 29,0772 in total

Arithmetic

Previous number29,076
Next number29,078
Double58,154
Square root170.519793572≈irrational, shown to 9 decimal places
Cube root30.750335996≈
Negation-29,077
Reciprocal0.0000343914≈

Representations

Decimal29,077
Binary11100011001010115 bits
Octal70625
Hexadecimal7195
Base 36MFP
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwenty-nine thousand and seventy-seven
Ordinaltwenty-nine thousand and seventy-seventh
Scientific notation2.9077 × 10^4
Engineering notation29.077 × 10^3

In other bases

Ternary1110212221base 3; the most digit-efficient integer base after e: 10 digits
Quinary1412302base 5; one hand: 7 digits
Septenary150526base 7: 6 digits
Nonary43787base 9; each digit is two ternary digits: 5 digits
Duodecimal149b1base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal3cdhbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal8:4:37base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary11110T00T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11011011010010101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

0111000110010101
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 odd
Highest set bitbit 14worth 16,384
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes271 95
Gray code100100101011111n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit0111000110010101
32-bit00000000000000000111000110010101
64-bit0000000000000000000000000000000000000000000000000111000110010101
One's complement1000111001101010at 16 bits, every bit flipped
Bits reversed1010100110001110at 16 bits
Rotated left by 11110001100101010at 16 bits, wrapping
Shifted left by 11110001100101010= 58,154, no wrap
Shifted right by 111100011001010= 14,538, discarding the low bit
These bits as a double1.43659468 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime29,101+24
Previous prime29,063−14
Distance to nearest prime0, it is prime
Nearest square below28,900
Nearest square above29,241

Powers & multiples

29,077 to the power 2845,471,929
29,077 to the power 324,583,787,279,533
29,077 to the power 4714,822,782,726,981,041
29,077 to the power 520,784,902,053,352,427,729,157
First ten multiples29,077, 58,154, 87,231, 116,308, 145,385, 174,462, 203,539, 232,616, 261,693, 290,770
Powers of twoBetween 2^14 (16,384) and 2^15 (32,768)

Divisibility tests

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

Collatz (3n + 1) trajectory

Steps to reach 172the total stopping time
Highest value reached87,2323× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps29,077 → 87,232 → 43,616 → 21,808 → 10,904 → 5,452 → 2,726 → 1,363 → 4,090 → 2,045 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage2,907,700%
29,077% as a decimal290.77
29,077% of 10029,077
29,077% of 1,000290,770
As a fraction of 10029,077/100

Read another way

As bytes28.396 KiB
As a 24-bit colour#007195

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