Recognised as Number
75,150
- Positive
- Even
- Composite
- 5 digits
75,150 is an even 5-digit integer and a composite number. It has 36 divisors and a digital root of 9.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value75,150
Digit count5
Digit sum18
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberYesdivisible by its own digit sum
Factors & divisors
Prime factorisation2 × 3^2 × 5^2 × 167
Distinct prime factors42, 3, 5, 167
Number of divisors36
Sum of divisors σ(n)203,112
Aliquot sum127,962sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)19,920integers below n that share no factor with it
Carmichael function λ(n)4,980the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 19,920
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 3, 5, 6, 9, 10, 15, 18, 25, 30, 45, 50, 75, 90, 150, 167, 225, 334, 450, 501, 835, 1,002, 1,503, 1,670, 2,505, 3,006, 4,175, 5,010, 7,515, 8,350, 12,525, 15,030, 25,050, 37,575, 75,15036 in total
Arithmetic
Representations
Decimal75,150
Binary1001001011000111017 bits
Octal222616
Hexadecimal1258E
Base 361LZI
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsseventy-five thousand, one hundred and fifty
Ordinalseventy-five thousand, one hundred and fiftieth
Scientific notation7.515 × 10^4
Engineering notation75.15 × 10^3
In other bases
Ternary10211002100base 3; the most digit-efficient integer base after e: 11 digits
Quinary4401100base 5; one hand: 7 digits
Septenary432045base 7: 6 digits
Nonary124070base 9; each digit is two ternary digits: 6 digits
Duodecimal375a6base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal97habase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal20:52:30base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary11T1101T100digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10111101010010010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000000010010010110001110
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 even
Highest set bitbit 16worth 65,536
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes301 25 8e
Gray code11011011101001001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000000010010010110001110
64-bit0000000000000000000000000000000000000000000000010010010110001110
One's complement11111111111111101101101001110001at 32 bits, every bit flipped
Bits reversed01110001101001001000000000000000at 32 bits
Rotated left by 100000000000000100100101100011100at 32 bits, wrapping
Shifted left by 1100100101100011100= 150,300, no wrap
Shifted right by 11001001011000111= 37,575, discarding the low bit
These bits as a double3.71290333 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
75,150 to the power 25,647,522,500
75,150 to the power 3424,411,315,875,000
75,150 to the power 431,894,510,388,006,250,000
75,150 to the power 52,396,872,455,658,669,687,500,000
First ten multiples75,150, 150,300, 225,450, 300,600, 375,750, 450,900, 526,050, 601,200, 676,350, 751,500
Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)
Divisibility tests
Divisible by 2Yes
Divisible by 3Yes
Divisible by 4No, remainder 2
Divisible by 5Yes
Divisible by 6Yes
Divisible by 7No, remainder 5
Divisible by 8No, remainder 6
Divisible by 9Yes
Divisible by 10Yes
Divisible by 11No, remainder 9
Divisible by 12No, remainder 6
Divisible by 100No, remainder 50
Collatz (3n + 1) trajectory
Steps to reach 163the total stopping time
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps75,150 → 37,575 → 112,726 → 56,363 → 169,090 → 84,545 → 253,636 → 126,818 → 63,409 → 190,228 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage7,515,000%
75,150% as a decimal751.5
75,150% of 10075,150
75,150% of 1,000751,500
As a fraction of 10075,150/100
Read another way
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from 75,150
Nerdulate something else
Nothing in mind? Surprise me · today’s page