Recognised as Number

60,262

Positive
Even
Composite
5 digits

60,262 is an even 5-digit integer and a composite number. It has 8 divisors and a digital root of 7.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value60,262

Digit count5

Digit sum16

Digit product0zero, because one of the digits is zero

Multiplicative persistence1times the digit product can be taken before one digit is left

Digital root7repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 29 × 1,039

Distinct prime factors32, 29, 1,039

Number of divisors8

Sum of divisors σ(n)93,600

Aliquot sum33,338sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)29,064integers below n that share no factor with it

Carmichael function λ(n)14,532the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 29,064

Möbius function μ(n)−13 distinct prime factors, an odd number of them

SquarefreeYesno repeated prime factor

All divisors1, 2, 29, 58, 1,039, 2,078, 30,131, 60,2628 in total

Arithmetic

Previous number60,261

Next number60,263

Double120,524

Half30,131

Square3,631,508,644

Cube218,841,973,904,728

Square root245.483196981≈irrational, shown to 9 decimal places

Cube root39.205576744≈

Negation-60,262

Reciprocal0.0000165942≈

Representations

Decimal60,262

Binary111010110110011016 bits

Octal165546

HexadecimalEB66

Base 361AHY

Roman numeralNot defined above 3,999there is no agreed standard notation

In wordssixty thousand, two hundred and sixty-two

Ordinalsixty thousand, two hundred and sixty-second

Scientific notation6.0262 × 10^4

Engineering notation60.262 × 10^3

In other bases

Ternary10001122221base 3; the most digit-efficient integer base after e: 11 digits

Quinary3412022base 5; one hand: 7 digits

Septenary340456base 7: 6 digits

Nonary101587base 9; each digit is two ternary digits: 6 digits

Duodecimal2aa5abase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits

Vigesimal7ad2base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits

Sexagesimal16:44:22base 60; Babylonian, and still how an hour and a circle are divided: 3 digits

Balanced ternary1001TT000T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed

Negabinary10011110010111010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

1110101101100110

Bit length16 bitsto write the magnitude

Set bits10the population count, or Hamming weight

Zero bits6within that length

Bit parityeven10 set bits, so even; not the same as the number itself being even

Highest set bitbit 15worth 32,768

Lowest set bitbit 11 trailing zero

Power of twoNo

Bytes2eb 66

Gray code1001111011010101n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1110101101100110

32-bit00000000000000001110101101100110

64-bit0000000000000000000000000000000000000000000000001110101101100110

One's complement0001010010011001at 16 bits, every bit flipped

Bits reversed0110011011010111at 16 bits

Rotated left by 11101011011001101at 16 bits, wrapping

Shifted left by 111101011011001100= 120,524, no wrap

Shifted right by 1111010110110011= 30,131, discarding the low bit

These bits as a double2.97733839 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime60,271+9

Previous prime60,259−3

Distance to nearest prime3

Nearest square below60,025

Nearest square above60,516

Powers & multiples

60,262 to the power 23,631,508,644

60,262 to the power 3218,841,973,904,728

60,262 to the power 413,187,855,031,446,718,736

60,262 to the power 5794,726,519,905,042,164,468,832

First ten multiples60,262, 120,524, 180,786, 241,048, 301,310, 361,572, 421,834, 482,096, 542,358, 602,620

Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)

Divisibility tests

Divisible by 2Yes

Divisible by 3No, remainder 1

Divisible by 4No, remainder 2

Divisible by 5No, remainder 2

Divisible by 6No, remainder 4

Divisible by 7No, remainder 6

Divisible by 8No, remainder 6

Divisible by 9No, remainder 7

Divisible by 10No, remainder 2

Divisible by 11No, remainder 4

Divisible by 12No, remainder 10

Divisible by 100No, remainder 62

Collatz (3n + 1) trajectory

Steps to reach 142the total stopping time

Highest value reached135,5922× the starting value

Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven

First steps60,262 → 30,131 → 90,394 → 45,197 → 135,592 → 67,796 → 33,898 → 16,949 → 50,848 → 25,424 → …

Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage6,026,200%

60,262% as a decimal602.62

60,262% of 10060,262

60,262% of 1,000602,620

As a fraction of 10060,262/100

Read another way

As seconds16 hours, 44 minutes and 22 seconds

As bytes58.85 KiB

As a 24-bit colour#00EB66

Keep nerding

Every link below is a page Nerdulator can generate from what it already knows about this value.