Recognised as Number
33,048
- Positive
- Even
- Composite
- 5 digits
33,048 is an even 5-digit integer and a composite number. It has 48 divisors and a digital root of 9.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value33,048
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 numberNosquared-digit sums reach 1
Harshad numberYesdivisible by its own digit sum
Factors & divisors
Prime factorisation2^3 × 3^5 × 17
Distinct prime factors32, 3, 17
Number of divisors48
Sum of divisors σ(n)98,280
Aliquot sum65,232sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)10,368integers below n that share no factor with it
Carmichael function λ(n)1,296the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 10,368
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 3, 4, 6, 8, 9, 12, 17, 18, 24, 27, 34, 36, 51, 54, 68, 72, 81, 102, 108, 136, 153, 162, 204, 216, 243, 306, 324, 408, 459, 486, 612, 648, 918, 972, 1,224, 1,377, 1,836, 1,944, 2,754, 3,672, 4,131, 5,508, 8,262, 11,016, 16,524, 33,04848 in total
Arithmetic
Representations
Decimal33,048
Binary100000010001100016 bits
Octal100430
Hexadecimal8118
Base 36PI0
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthirty-three thousand and forty-eight
Ordinalthirty-three thousand and forty-eighth
Scientific notation3.3048 × 10^4
Engineering notation33.048 × 10^3
In other bases
Ternary1200100000base 3; the most digit-efficient integer base after e: 10 digits
Quinary2024143base 5; one hand: 7 digits
Septenary165231base 7: 6 digits
Nonary50300base 9; each digit is two ternary digits: 5 digits
Duodecimal17160base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal42c8base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal9:10:48base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary1TT00100000digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11000000101101000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1000000100011000
Bit length16 bitsto write the magnitude
Set bits4the population count, or Hamming weight
Zero bits12within that length
Bit parityeven4 set bits, so even; not the same as the number itself being even
Highest set bitbit 15worth 32,768
Lowest set bitbit 33 trailing zeros
Power of twoNo
Bytes281 18
Gray code1100000110010100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1000000100011000
32-bit00000000000000001000000100011000
64-bit0000000000000000000000000000000000000000000000001000000100011000
One's complement0111111011100111at 16 bits, every bit flipped
Bits reversed0001100010000001at 16 bits
Rotated left by 10000001000110001at 16 bits, wrapping
Shifted left by 110000001000110000= 66,096, no wrap
Shifted right by 1100000010001100= 16,524, discarding the low bit
These bits as a double1.63278815 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
33,048 to the power 21,092,170,304
33,048 to the power 336,094,044,206,592
33,048 to the power 41,192,835,972,939,452,416
33,048 to the power 539,420,843,233,703,023,443,968
First ten multiples33,048, 66,096, 99,144, 132,192, 165,240, 198,288, 231,336, 264,384, 297,432, 330,480
Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)
Divisibility tests
Divisible by 2Yes
Divisible by 3Yes
Divisible by 4Yes
Divisible by 5No, remainder 3
Divisible by 6Yes
Divisible by 7No, remainder 1
Divisible by 8Yes
Divisible by 9Yes
Divisible by 10No, remainder 8
Divisible by 11No, remainder 4
Divisible by 12Yes
Divisible by 100No, remainder 48
Collatz (3n + 1) trajectory
Steps to reach 1129the total stopping time
Highest value reached33,048
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps33,048 → 16,524 → 8,262 → 4,131 → 12,394 → 6,197 → 18,592 → 9,296 → 4,648 → 2,324 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage3,304,800%
33,048% as a decimal330.48
33,048% of 10033,048
33,048% of 1,000330,480
As a fraction of 10033,048/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 33,048
Nerdulate something else
Nothing in mind? Surprise me · today’s page