Recognised as Number
72,915
- Positive
- Odd
- Composite
- 5 digits
72,915 is an odd 5-digit integer and a composite number. It has 8 divisors and a digital root of 6.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value72,915
Digit count5
Digit sum24
Digit product630
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root6repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3 × 5 × 4,861
Distinct prime factors33, 5, 4,861
Number of divisors8
Sum of divisors σ(n)116,688
Aliquot sum43,773sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)38,880integers below n that share no factor with it
Carmichael function λ(n)4,860the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 38,880
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 3, 5, 15, 4,861, 14,583, 24,305, 72,9158 in total
Arithmetic
Representations
Decimal72,915
Binary1000111001101001117 bits
Octal216323
Hexadecimal11CD3
Base 361K9F
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsseventy-two thousand, nine hundred and fifteen
Ordinalseventy-two thousand, nine hundred and fifteenth
Scientific notation7.2915 × 10^4
Engineering notation72.915 × 10^3
In other bases
Ternary10201000120base 3; the most digit-efficient integer base after e: 11 digits
Quinary4313130base 5; one hand: 7 digits
Septenary422403base 7: 6 digits
Nonary121016base 9; each digit is two ternary digits: 6 digits
Duodecimal36243base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal925fbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal20:15:15base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary11T01001TT0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10110110111010111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000000010001110011010011
Bit length17 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits8within that length
Bit parityodd9 set bits, so odd; 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 d3
Gray code11001001010111010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000000010001110011010011
64-bit0000000000000000000000000000000000000000000000010001110011010011
One's complement11111111111111101110001100101100at 32 bits, every bit flipped
Bits reversed11001011001110001000000000000000at 32 bits
Rotated left by 100000000000000100011100110100110at 32 bits, wrapping
Shifted left by 1100011100110100110= 145,830, no wrap
Shifted right by 11000111001101001= 36,457, discarding the low bit
These bits as a double3.60247966 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
72,915 to the power 25,316,597,225
72,915 to the power 3387,659,686,660,875
72,915 to the power 428,266,206,052,877,700,625
72,915 to the power 52,061,030,414,345,577,541,071,875
First ten multiples72,915, 145,830, 218,745, 291,660, 364,575, 437,490, 510,405, 583,320, 656,235, 729,150
Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 3
Divisible by 5Yes
Divisible by 6No, remainder 3
Divisible by 7No, remainder 3
Divisible by 8No, remainder 3
Divisible by 9No, remainder 6
Divisible by 10No, remainder 5
Divisible by 11No, remainder 7
Divisible by 12No, remainder 3
Divisible by 100No, remainder 15
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,915 → 218,746 → 109,373 → 328,120 → 164,060 → 82,030 → 41,015 → 123,046 → 61,523 → 184,570 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage7,291,500%
72,915% as a decimal729.15
72,915% of 10072,915
72,915% of 1,000729,150
As a fraction of 10072,915/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,915
Nerdulate something else
Nothing in mind? Surprise me · today’s page