Recognised as Number

60,427

Positive
Odd
Prime
5 digits

60,427 is an odd 5-digit integer and a prime number. It has 2 divisors and a digital root of 1.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value60,427

Digit count5

Digit sum19

Digit product0zero, because one of the digits is zero

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

Digital root1repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation60,427

Distinct prime factors160,427

Number of divisors2

Sum of divisors σ(n)60,428

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)60,426the smallest exponent with aˣ ≡ 1 for every unit coprime to n

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

SquarefreeYesno repeated prime factor

All divisors1, 60,4272 in total

Arithmetic

Previous number60,426

Next number60,428

Double120,854

Half30,213.5

Square3,651,422,329

Cube220,644,497,074,483

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

Cube root39.241326332≈

Negation-60,427

Reciprocal0.0000165489≈

Representations

Decimal60,427

Binary111011000000101116 bits

Octal166013

HexadecimalEC0B

Base 361AMJ

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

In wordssixty thousand, four hundred and twenty-seven

Ordinalsixty thousand, four hundred and twenty-seventh

Scientific notation6.0427 × 10^4

Engineering notation60.427 × 10^3

In other bases

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

Quinary3413202base 5; one hand: 7 digits

Septenary341113base 7: 6 digits

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

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

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

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

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

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

Bit-level

1110110000001011

Bit length16 bitsto write the magnitude

Set bits8the population count, or Hamming weight

Zero bits8within that length

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

Highest set bitbit 15worth 32,768

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes2ec 0b

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

At each machine width

16-bit1110110000001011

32-bit00000000000000001110110000001011

64-bit0000000000000000000000000000000000000000000000001110110000001011

One's complement0001001111110100at 16 bits, every bit flipped

Bits reversed1101000000110111at 16 bits

Rotated left by 11101100000010111at 16 bits, wrapping

Shifted left by 111101100000010110= 120,854, no wrap

Shifted right by 1111011000000101= 30,213, discarding the low bit

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

Nearest landmarks

Next prime60,443+16

Previous prime60,413−14

Distance to nearest prime0, it is prime

Nearest square below60,025

Nearest square above60,516

Powers & multiples

60,427 to the power 23,651,422,329

60,427 to the power 3220,644,497,074,483

60,427 to the power 413,332,885,024,719,784,241

60,427 to the power 5805,666,243,388,742,402,330,907

First ten multiples60,427, 120,854, 181,281, 241,708, 302,135, 362,562, 422,989, 483,416, 543,843, 604,270

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

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 1

Divisible by 4No, remainder 3

Divisible by 5No, remainder 2

Divisible by 6No, remainder 1

Divisible by 7No, remainder 3

Divisible by 8No, remainder 3

Divisible by 9No, remainder 1

Divisible by 10No, remainder 7

Divisible by 11No, remainder 4

Divisible by 12No, remainder 7

Divisible by 100No, remainder 27

Collatz (3n + 1) trajectory

Steps to reach 1135the total stopping time

Highest value reached271,9244× the starting value

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

First steps60,427 → 181,282 → 90,641 → 271,924 → 135,962 → 67,981 → 203,944 → 101,972 → 50,986 → 25,493 → …

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

As a percentage & fraction

As a percentage6,042,700%

60,427% as a decimal604.27

60,427% of 10060,427

60,427% of 1,000604,270

As a fraction of 10060,427/100

Read another way

As seconds16 hours, 47 minutes and 7 seconds

As bytes59.011 KiB

As a 24-bit colour#00EC0B

Keep nerding

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