Recognised as Number

47,402

Positive
Even
Composite
5 digits

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

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value47,402

Digit count5

Digit sum17

Digit product0zero, because one of the digits is zero

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

Digital root8repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 137 × 173

Distinct prime factors32, 137, 173

Number of divisors8

Sum of divisors σ(n)72,036

Aliquot sum24,634sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)5,848the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 23,392

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

SquarefreeYesno repeated prime factor

All divisors1, 2, 137, 173, 274, 346, 23,701, 47,4028 in total

Arithmetic

Previous number47,401

Next number47,403

Double94,804

Half23,701

Square2,246,949,604

Cube106,509,905,128,808

Square root217.720003674≈irrational, shown to 9 decimal places

Cube root36.190858777≈

Negation-47,402

Reciprocal0.0000210962≈

Representations

Decimal47,402

Binary101110010010101016 bits

Octal134452

HexadecimalB92A

Base 3610KQ

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

In wordsforty-seven thousand, four hundred and two

Ordinalforty-seven thousand, four hundred and second

Scientific notation4.7402 × 10^4

Engineering notation47.402 × 10^3

In other bases

Ternary2102000122base 3; the most digit-efficient integer base after e: 10 digits

Quinary3004102base 5; one hand: 7 digits

Septenary255125base 7: 6 digits

Nonary72018base 9; each digit is two ternary digits: 5 digits

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

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

Sexagesimal13:10:2base 60; Babylonian, and still how an hour and a circle are divided: 3 digits

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

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

Bit-level

1011100100101010

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 even

Highest set bitbit 15worth 32,768

Lowest set bitbit 11 trailing zero

Power of twoNo

Bytes2b9 2a

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

At each machine width

16-bit1011100100101010

32-bit00000000000000001011100100101010

64-bit0000000000000000000000000000000000000000000000001011100100101010

One's complement0100011011010101at 16 bits, every bit flipped

Bits reversed0101010010011101at 16 bits

Rotated left by 10111001001010101at 16 bits, wrapping

Shifted left by 110111001001010100= 94,804, no wrap

Shifted right by 1101110010010101= 23,701, discarding the low bit

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

Nearest landmarks

Next prime47,407+5

Previous prime47,389−13

Distance to nearest prime5

Nearest square below47,089

Nearest square above47,524

Powers & multiples

47,402 to the power 22,246,949,604

47,402 to the power 3106,509,905,128,808

47,402 to the power 45,048,782,522,915,756,816

47,402 to the power 5239,322,389,151,252,704,592,032

First ten multiples47,402, 94,804, 142,206, 189,608, 237,010, 284,412, 331,814, 379,216, 426,618, 474,020

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

Divisibility tests

Divisible by 2Yes

Divisible by 3No, remainder 2

Divisible by 4No, remainder 2

Divisible by 5No, remainder 2

Divisible by 6No, remainder 2

Divisible by 7No, remainder 5

Divisible by 8No, remainder 2

Divisible by 9No, remainder 8

Divisible by 10No, remainder 2

Divisible by 11No, remainder 3

Divisible by 12No, remainder 2

Divisible by 100No, remainder 2

Collatz (3n + 1) trajectory

Steps to reach 139the total stopping time

Highest value reached71,1041× the starting value

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

First steps47,402 → 23,701 → 71,104 → 35,552 → 17,776 → 8,888 → 4,444 → 2,222 → 1,111 → 3,334 → …

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

As a percentage & fraction

As a percentage4,740,200%

47,402% as a decimal474.02

47,402% of 10047,402

47,402% of 1,000474,020

As a fraction of 10047,402/100

Read another way

As seconds13 hours, 10 minutes and 2 seconds

As bytes46.291 KiB

As a 24-bit colour#00B92A

Keep nerding

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