Recognised as Number
46,750
- Positive
- Even
- Composite
- 5 digits
46,750 is an even 5-digit integer and a composite number. It has 32 divisors and a digital root of 4.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value46,750
Digit count5
Digit sum22
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times 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 numberYesdivisible by its own digit sum
Factors & divisors
Prime factorisation2 × 5^3 × 11 × 17
Distinct prime factors42, 5, 11, 17
Number of divisors32
Sum of divisors σ(n)101,088
Aliquot sum54,338sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)16,000integers below n that share no factor with it
Carmichael function λ(n)400the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 16,000
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 5, 10, 11, 17, 22, 25, 34, 50, 55, 85, 110, 125, 170, 187, 250, 275, 374, 425, 550, 850, 935, 1,375, 1,870, 2,125, 2,750, 4,250, 4,675, 9,350, 23,375, 46,75032 in total
Arithmetic
Representations
Decimal46,750
Binary101101101001111016 bits
Octal133236
HexadecimalB69E
Base 36102M
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsforty-six thousand, seven hundred and fifty
Ordinalforty-six thousand, seven hundred and fiftieth
Scientific notation4.675 × 10^4
Engineering notation46.75 × 10^3
In other bases
Ternary2101010111base 3; the most digit-efficient integer base after e: 10 digits
Quinary2444000base 5; one hand: 7 digits
Septenary253204base 7: 6 digits
Nonary71114base 9; each digit is two ternary digits: 5 digits
Duodecimal2307abase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal5ghabase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal12:59:10base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary1T101010111digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11100101111100010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1011011010011110
Bit length16 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits6within that length
Bit parityeven10 set bits, so even; not the same as the number itself being even
Highest set bitbit 15worth 32,768
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes2b6 9e
Gray code1110110111010001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1011011010011110
32-bit00000000000000001011011010011110
64-bit0000000000000000000000000000000000000000000000001011011010011110
One's complement0100100101100001at 16 bits, every bit flipped
Bits reversed0111100101101101at 16 bits
Rotated left by 10110110100111101at 16 bits, wrapping
Shifted left by 110110110100111100= 93,500, no wrap
Shifted right by 1101101101001111= 23,375, discarding the low bit
These bits as a double2.30975689 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
46,750 to the power 22,185,562,500
46,750 to the power 3102,175,046,875,000
46,750 to the power 44,776,683,441,406,250,000
46,750 to the power 5223,309,950,885,742,187,500,000
First ten multiples46,750, 93,500, 140,250, 187,000, 233,750, 280,500, 327,250, 374,000, 420,750, 467,500
Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 1
Divisible by 4No, remainder 2
Divisible by 5Yes
Divisible by 6No, remainder 4
Divisible by 7No, remainder 4
Divisible by 8No, remainder 6
Divisible by 9No, remainder 4
Divisible by 10Yes
Divisible by 11Yes
Divisible by 12No, remainder 10
Divisible by 100No, remainder 50
Collatz (3n + 1) trajectory
Steps to reach 170the total stopping time
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps46,750 → 23,375 → 70,126 → 35,063 → 105,190 → 52,595 → 157,786 → 78,893 → 236,680 → 118,340 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage4,675,000%
46,750% as a decimal467.5
46,750% of 10046,750
46,750% of 1,000467,500
As a fraction of 10046,750/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 46,750
Nerdulate something else
Nothing in mind? Surprise me · today’s page