Recognised as Number
60,426
- Positive
- Even
- Composite
- 5 digits
60,426 is an even 5-digit integer and a composite number. It has 20 divisors and a digital root of 9.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value60,426
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^4 × 373
Distinct prime factors32, 3, 373
Number of divisors20
Sum of divisors σ(n)135,762
Aliquot sum75,336sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)20,088integers below n that share no factor with it
Carmichael function λ(n)3,348the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 20,088
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 3, 6, 9, 18, 27, 54, 81, 162, 373, 746, 1,119, 2,238, 3,357, 6,714, 10,071, 20,142, 30,213, 60,42620 in total
Arithmetic
Representations
Decimal60,426
Binary111011000000101016 bits
Octal166012
HexadecimalEC0A
Base 361AMI
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordssixty thousand, four hundred and twenty-six
Ordinalsixty thousand, four hundred and twenty-sixth
Scientific notation6.0426 × 10^4
Engineering notation60.426 × 10^3
In other bases
Ternary10001220000base 3; the most digit-efficient integer base after e: 11 digits
Quinary3413201base 5; one hand: 7 digits
Septenary341112base 7: 6 digits
Nonary101800base 9; each digit is two ternary digits: 6 digits
Duodecimal2ab76base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal7b16base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal16:47:6base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary1001T0T0000digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10011110000011110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1110110000001010
Bit length16 bitsto write the magnitude
Set bits7the population count, or Hamming weight
Zero bits9within that length
Bit parityodd7 set bits, so odd; not the same as the number itself being even
Highest set bitbit 15worth 32,768
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes2ec 0a
Gray code1001101000001111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1110110000001010
32-bit00000000000000001110110000001010
64-bit0000000000000000000000000000000000000000000000001110110000001010
One's complement0001001111110101at 16 bits, every bit flipped
Bits reversed0101000000110111at 16 bits
Rotated left by 11101100000010101at 16 bits, wrapping
Shifted left by 111101100000010100= 120,852, no wrap
Shifted right by 1111011000000101= 30,213, discarding the low bit
These bits as a double2.98544107 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
60,426 to the power 23,651,301,476
60,426 to the power 3220,633,542,988,776
60,426 to the power 413,332,002,468,639,778,576
60,426 to the power 5805,599,581,170,027,260,233,376
First ten multiples60,426, 120,852, 181,278, 241,704, 302,130, 362,556, 422,982, 483,408, 543,834, 604,260
Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)
Divisibility tests
Divisible by 2Yes
Divisible by 3Yes
Divisible by 4No, remainder 2
Divisible by 5No, remainder 1
Divisible by 6Yes
Divisible by 7No, remainder 2
Divisible by 8No, remainder 2
Divisible by 9Yes
Divisible by 10No, remainder 6
Divisible by 11No, remainder 3
Divisible by 12No, remainder 6
Divisible by 100No, remainder 26
Collatz (3n + 1) trajectory
Steps to reach 1135the total stopping time
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps60,426 → 30,213 → 90,640 → 45,320 → 22,660 → 11,330 → 5,665 → 16,996 → 8,498 → 4,249 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage6,042,600%
60,426% as a decimal604.26
60,426% of 10060,426
60,426% of 1,000604,260
As a fraction of 10060,426/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 60,426
Nerdulate something else
Nothing in mind? Surprise me · today’s page