Recognised as Number
30,672
- Positive
- Even
- Composite
- 5 digits
30,672 is an even 5-digit integer and a composite number. It has 40 divisors and a digital root of 9.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value30,672
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^4 × 3^3 × 71
Distinct prime factors32, 3, 71
Number of divisors40
Sum of divisors σ(n)89,280
Aliquot sum58,608sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)10,080integers below n that share no factor with it
Carmichael function λ(n)1,260the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 10,080
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, 16, 18, 24, 27, 36, 48, 54, 71, 72, 108, 142, 144, 213, 216, 284, 426, 432, 568, 639, 852, 1,136, 1,278, 1,704, 1,917, 2,556, 3,408, 3,834, 5,112, 7,668, 10,224, 15,336, 30,67240 in total
Arithmetic
Representations
Decimal30,672
Binary11101111101000015 bits
Octal73720
Hexadecimal77D0
Base 36NO0
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthirty thousand, six hundred and seventy-two
Ordinalthirty thousand, six hundred and seventy-second
Scientific notation3.0672 × 10^4
Engineering notation30.672 × 10^3
In other bases
Ternary1120002000base 3; the most digit-efficient integer base after e: 10 digits
Quinary1440142base 5; one hand: 7 digits
Septenary155265base 7: 6 digits
Nonary46060base 9; each digit is two ternary digits: 5 digits
Duodecimal15900base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal3gdcbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal8:31:12base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary1TTT001T000digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11000100011010000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
0111011111010000
Bit length15 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits6within that length
Bit parityodd9 set bits, so odd; not the same as the number itself being even
Highest set bitbit 14worth 16,384
Lowest set bitbit 44 trailing zeros
Power of twoNo
Bytes277 d0
Gray code100110000111000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit0111011111010000
32-bit00000000000000000111011111010000
64-bit0000000000000000000000000000000000000000000000000111011111010000
One's complement1000100000101111at 16 bits, every bit flipped
Bits reversed0000101111101110at 16 bits
Rotated left by 11110111110100000at 16 bits, wrapping
Shifted left by 11110111110100000= 61,344, no wrap
Shifted right by 111101111101000= 15,336, discarding the low bit
These bits as a double1.51539815 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
30,672 to the power 2940,771,584
30,672 to the power 328,855,346,024,448
30,672 to the power 4885,051,173,261,869,056
30,672 to the power 527,146,289,586,288,047,685,632
First ten multiples30,672, 61,344, 92,016, 122,688, 153,360, 184,032, 214,704, 245,376, 276,048, 306,720
Powers of twoBetween 2^14 (16,384) and 2^15 (32,768)
Divisibility tests
Divisible by 2Yes
Divisible by 3Yes
Divisible by 4Yes
Divisible by 5No, remainder 2
Divisible by 6Yes
Divisible by 7No, remainder 5
Divisible by 8Yes
Divisible by 9Yes
Divisible by 10No, remainder 2
Divisible by 11No, remainder 4
Divisible by 12Yes
Divisible by 100No, remainder 72
Collatz (3n + 1) trajectory
Steps to reach 159the total stopping time
Highest value reached30,672
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps30,672 → 15,336 → 7,668 → 3,834 → 1,917 → 5,752 → 2,876 → 1,438 → 719 → 2,158 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage3,067,200%
30,672% as a decimal306.72
30,672% of 10030,672
30,672% of 1,000306,720
As a fraction of 10030,672/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 30,672
Nerdulate something else
Nothing in mind? Surprise me · today’s page