Nerdulator> put something in

Recognised as Number

75,149

  • Positive
  • Odd
  • Prime
  • 5 digits

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

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value75,149
Digit count5
Digit sum26
Digit product1,260
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation75,149
Distinct prime factors175,149
Number of divisors2
Sum of divisors σ(n)75,150
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)75,148integers below n that share no factor with it
Carmichael function λ(n)75,148the 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, 75,1492 in total

Arithmetic

Previous number75,148
Next number75,150
Double150,298
Square root274.133179313≈irrational, shown to 9 decimal places
Cube root42.199541784≈
Negation-75,149
Reciprocal0.0000133069≈

Representations

Decimal75,149
Binary1001001011000110117 bits
Octal222615
Hexadecimal1258D
Base 361LZH
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsseventy-five thousand, one hundred and forty-nine
Ordinalseventy-five thousand, one hundred and forty-ninth
Scientific notation7.5149 × 10^4
Engineering notation75.149 × 10^3

In other bases

Ternary10211002022base 3; the most digit-efficient integer base after e: 11 digits
Quinary4401044base 5; one hand: 7 digits
Septenary432044base 7: 6 digits
Nonary124068base 9; each digit is two ternary digits: 6 digits
Duodecimal375a5base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal97h9base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal20:52:29base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary11T1101T10Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10111101010011101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000000000010010010110001101
Bit length17 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits9within that length
Bit parityeven8 set bits, so even; not the same as the number itself being odd
Highest set bitbit 16worth 65,536
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes301 25 8d
Gray code11011011101001011n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000000000010010010110001101
64-bit0000000000000000000000000000000000000000000000010010010110001101
One's complement11111111111111101101101001110010at 32 bits, every bit flipped
Bits reversed10110001101001001000000000000000at 32 bits
Rotated left by 100000000000000100100101100011010at 32 bits, wrapping
Shifted left by 1100100101100011010= 150,298, no wrap
Shifted right by 11001001011000110= 37,574, discarding the low bit
These bits as a double3.71285392 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime75,161+12
Previous prime75,133−16
Distance to nearest prime0, it is prime
Nearest square below75,076
Nearest square above75,625

Powers & multiples

75,149 to the power 25,647,372,201
75,149 to the power 3424,394,373,532,949
75,149 to the power 431,892,812,776,627,584,401
75,149 to the power 52,396,712,987,350,786,340,150,749
First ten multiples75,149, 150,298, 225,447, 300,596, 375,745, 450,894, 526,043, 601,192, 676,341, 751,490
Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)

Divisibility tests

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

Collatz (3n + 1) trajectory

Steps to reach 1112the total stopping time
Highest value reached225,4483× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps75,149 → 225,448 → 112,724 → 56,362 → 28,181 → 84,544 → 42,272 → 21,136 → 10,568 → 5,284 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage7,514,900%
75,149% as a decimal751.49
75,149% of 10075,149
75,149% of 1,000751,490
As a fraction of 10075,149/100

Read another way

As bytes73.388 KiB
As a 24-bit colour#01258D

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