Recognised as Number

31,473

Positive
Odd
Composite
5 digits

31,473 is an odd 5-digit integer and a composite number. It has 12 divisors and a digital root of 9.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value31,473

Digit count5

Digit sum18

Digit product252

Multiplicative persistence3times 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 numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3^2 × 13 × 269

Distinct prime factors33, 13, 269

Number of divisors12

Sum of divisors σ(n)49,140

Aliquot sum17,667sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)804the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 19,296

Möbius function μ(n)0zero, because a prime divides n twice

SquarefreeNohas a repeated prime factor

All divisors1, 3, 9, 13, 39, 117, 269, 807, 2,421, 3,497, 10,491, 31,47312 in total

Arithmetic

Previous number31,472

Next number31,474

Double62,946

Half15,736.5

Square990,549,729

Cube31,175,571,620,817

Square root177.406313304≈irrational, shown to 9 decimal places

Cube root31.572772038≈

Negation-31,473

Reciprocal0.0000317733≈

Representations

Decimal31,473

Binary11110101111000115 bits

Octal75361

Hexadecimal7AF1

Base 36OA9

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

In wordsthirty-one thousand, four hundred and seventy-three

Ordinalthirty-one thousand, four hundred and seventy-third

Scientific notation3.1473 × 10^4

Engineering notation31.473 × 10^3

In other bases

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

Quinary2001343base 5; one hand: 7 digits

Septenary160521base 7: 6 digits

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

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

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

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

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

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

Bit-level

0111101011110001

Bit length15 bitsto write the magnitude

Set bits10the population count, or Hamming weight

Zero bits5within that length

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

Highest set bitbit 14worth 16,384

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes27a f1

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

At each machine width

16-bit0111101011110001

32-bit00000000000000000111101011110001

64-bit0000000000000000000000000000000000000000000000000111101011110001

One's complement1000010100001110at 16 bits, every bit flipped

Bits reversed1000111101011110at 16 bits

Rotated left by 11111010111100010at 16 bits, wrapping

Shifted left by 11111010111100010= 62,946, no wrap

Shifted right by 111110101111000= 15,736, discarding the low bit

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

Nearest landmarks

Next prime31,477+4

Previous prime31,469−4

Distance to nearest prime4

Nearest square below31,329

Nearest square above31,684

Powers & multiples

31,473 to the power 2990,549,729

31,473 to the power 331,175,571,620,817

31,473 to the power 4981,188,765,621,973,441

31,473 to the power 530,880,954,020,420,370,108,593

First ten multiples31,473, 62,946, 94,419, 125,892, 157,365, 188,838, 220,311, 251,784, 283,257, 314,730

Powers of twoBetween 2^14 (16,384) and 2^15 (32,768)

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3Yes

Divisible by 4No, remainder 1

Divisible by 5No, remainder 3

Divisible by 6No, remainder 3

Divisible by 7No, remainder 1

Divisible by 8No, remainder 1

Divisible by 9Yes

Divisible by 10No, remainder 3

Divisible by 11No, remainder 2

Divisible by 12No, remainder 9

Divisible by 100No, remainder 73

Collatz (3n + 1) trajectory

Steps to reach 1147the total stopping time

Highest value reached94,4203× the starting value

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

First steps31,473 → 94,420 → 47,210 → 23,605 → 70,816 → 35,408 → 17,704 → 8,852 → 4,426 → 2,213 → …

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

As a percentage & fraction

As a percentage3,147,300%

31,473% as a decimal314.73

31,473% of 10031,473

31,473% of 1,000314,730

As a fraction of 10031,473/100

Read another way

As seconds8 hours, 44 minutes and 33 seconds

As bytes30.735 KiB

As a 24-bit colour#007AF1

Keep nerding

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