Recognised as Number
72,913
- Positive
- Odd
- Composite
- 5 digits
72,913 is an odd 5-digit integer and a composite number. It has 4 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value72,913
Digit count5
Digit sum22
Digit product378
Multiplicative persistence5times 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 numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation17 × 4,289
Distinct prime factors217, 4,289
Number of divisors4
Sum of divisors σ(n)77,220
Aliquot sum4,307sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)68,608integers below n that share no factor with it
Carmichael function λ(n)4,288the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 68,608
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 17, 4,289, 72,9134 in total
Arithmetic
Representations
Decimal72,913
Binary1000111001101000117 bits
Octal216321
Hexadecimal11CD1
Base 361K9D
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsseventy-two thousand, nine hundred and thirteen
Ordinalseventy-two thousand, nine hundred and thirteenth
Scientific notation7.2913 × 10^4
Engineering notation72.913 × 10^3
In other bases
Ternary10201000111base 3; the most digit-efficient integer base after e: 11 digits
Quinary4313123base 5; one hand: 7 digits
Septenary422401base 7: 6 digits
Nonary121014base 9; each digit is two ternary digits: 6 digits
Duodecimal36241base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal925dbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal20:15:13base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary11T01000111digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10110110111010001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000000010001110011010001
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 1c d1
Gray code11001001010111001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000000010001110011010001
64-bit0000000000000000000000000000000000000000000000010001110011010001
One's complement11111111111111101110001100101110at 32 bits, every bit flipped
Bits reversed10001011001110001000000000000000at 32 bits
Rotated left by 100000000000000100011100110100010at 32 bits, wrapping
Shifted left by 1100011100110100010= 145,826, no wrap
Shifted right by 11000111001101000= 36,456, discarding the low bit
These bits as a double3.60238084 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
72,913 to the power 25,316,305,569
72,913 to the power 3387,627,787,952,497
72,913 to the power 428,263,104,902,980,413,761
72,913 to the power 52,060,747,767,791,010,908,555,793
First ten multiples72,913, 145,826, 218,739, 291,652, 364,565, 437,478, 510,391, 583,304, 656,217, 729,130
Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 1
Divisible by 5No, remainder 3
Divisible by 6No, remainder 1
Divisible by 7No, remainder 1
Divisible by 8No, remainder 1
Divisible by 9No, remainder 4
Divisible by 10No, remainder 3
Divisible by 11No, remainder 5
Divisible by 12No, remainder 1
Divisible by 100No, remainder 13
Collatz (3n + 1) trajectory
Steps to reach 1125the total stopping time
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps72,913 → 218,740 → 109,370 → 54,685 → 164,056 → 82,028 → 41,014 → 20,507 → 61,522 → 30,761 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage7,291,300%
72,913% as a decimal729.13
72,913% of 10072,913
72,913% of 1,000729,130
As a fraction of 10072,913/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 72,913
Nerdulate something else
Nothing in mind? Surprise me · today’s page