Nerdulator> put something in

Recognised as Number

34,231

  • Positive
  • Odd
  • Prime
  • 5 digits

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

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value34,231
Digit count5
Digit sum13
Digit product72
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation34,231
Distinct prime factors134,231
Number of divisors2
Sum of divisors σ(n)34,232
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)34,230integers below n that share no factor with it
Carmichael function λ(n)34,230the 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, 34,2312 in total

Arithmetic

Previous number34,230
Next number34,232
Double68,462
Square root185.016215506≈irrational, shown to 9 decimal places
Cube root32.46932016≈
Negation-34,231
Reciprocal0.0000292133≈

Representations

Decimal34,231
Binary100001011011011116 bits
Octal102667
Hexadecimal85B7
Base 36QEV
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthirty-four thousand, two hundred and thirty-one
Ordinalthirty-four thousand, two hundred and thirty-first
Scientific notation3.4231 × 10^4
Engineering notation34.231 × 10^3

In other bases

Ternary1201221211base 3; the most digit-efficient integer base after e: 10 digits
Quinary2043411base 5; one hand: 7 digits
Septenary201541base 7: 6 digits
Nonary51854base 9; each digit is two ternary digits: 5 digits
Duodecimal17987base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal45bbbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal9:30:31base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary1TT1T00TT11digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11001101011001011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

1000010110110111
Bit length16 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits7within that length
Bit parityodd9 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 15worth 32,768
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes285 b7
Gray code1100011101101100n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1000010110110111
32-bit00000000000000001000010110110111
64-bit0000000000000000000000000000000000000000000000001000010110110111
One's complement0111101001001000at 16 bits, every bit flipped
Bits reversed1110110110100001at 16 bits
Rotated left by 10000101101101111at 16 bits, wrapping
Shifted left by 110000101101101110= 68,462, no wrap
Shifted right by 1100001011011011= 17,115, discarding the low bit
These bits as a double1.69123611 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime34,253+22
Previous prime34,217−14
Distance to nearest prime0, it is prime
Nearest square below34,225
Nearest square above34,596

Powers & multiples

34,231 to the power 21,171,761,361
34,231 to the power 340,110,563,148,391
34,231 to the power 41,373,024,687,132,572,321
34,231 to the power 547,000,008,065,235,083,120,151
First ten multiples34,231, 68,462, 102,693, 136,924, 171,155, 205,386, 239,617, 273,848, 308,079, 342,310
Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)

Divisibility tests

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

Collatz (3n + 1) trajectory

Steps to reach 154the total stopping time
Highest value reached231,0646× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps34,231 → 102,694 → 51,347 → 154,042 → 77,021 → 231,064 → 115,532 → 57,766 → 28,883 → 86,650 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage3,423,100%
34,231% as a decimal342.31
34,231% of 10034,231
34,231% of 1,000342,310
As a fraction of 10034,231/100

Read another way

As bytes33.429 KiB
As a 24-bit colour#0085B7

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