Nerdulator> put something in

Number

29,363

  • Positive
  • Odd
  • Prime
  • 5 digits

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

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value29,363
Digit count5
Digit sum23
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation29,363
Distinct prime factors129,363
Number of divisors2
Sum of divisors σ(n)29,364
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)29,362integers below n that share no factor with it
SquarefreeYesno repeated prime factor
All divisors1, 29,3632 in total

Arithmetic

Previous number29,362
Next number29,364
Double58,726
Square root171.356353836irrational, shown to 9 decimal places
Cube root30.850826856
Negation-29,363
Reciprocal0.0000340565

Representations

Decimal29,363
Binary11100101011001115 bits
Octal71263
Hexadecimal72B3
Base 36MNN
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwenty-nine thousand, three hundred and sixty-three
Ordinaltwenty-nine thousand, three hundred and sixty-third
Scientific notation2.9363 × 10^4
Engineering notation29.363 × 10^3

Nearest landmarks

Next prime29,383+20
Previous prime29,347−16
Distance to nearest prime0, it is prime
Nearest square below29,241
Nearest square above29,584

Powers & multiples

29,363 to the power 2862,185,769
29,363 to the power 325,316,360,735,147
29,363 to the power 4743,364,300,266,121,361
29,363 to the power 521,827,405,948,714,121,523,043
First ten multiples29,363, 58,726, 88,089, 117,452, 146,815, 176,178, 205,541, 234,904, 264,267, 293,630
Powers of twoBetween 2^14 (16,384) and 2^15 (32,768)

Divisibility tests

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

Collatz (3n + 1) trajectory

Steps to reach 1196the total stopping time
Highest value reached190,9966× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps29,363 → 88,090 → 44,045 → 132,136 → 66,068 → 33,034 → 16,517 → 49,552 → 24,776 → 12,388 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage2,936,300%
29,363% as a decimal293.63
29,363% of 10029,363
29,363% of 1,000293,630
As a fraction of 10029,363/100

Read another way

As bytes28.675 KiB
As a 24-bit colour#0072B3

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