Recognised as Number

30,625

Positive
Odd
Composite
Perfect square
5 digits

30,625 is an odd 5-digit integer and a composite number. It has 15 divisors and a digital root of 7.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value30,625

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

Perfect squareYes, 175²

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation5^4 × 7^2

Distinct prime factors25, 7

Number of divisors15

Sum of divisors σ(n)44,517

Aliquot sum13,892sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)10,500the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 21,000

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

SquarefreeNohas a repeated prime factor

All divisors1, 5, 7, 25, 35, 49, 125, 175, 245, 625, 875, 1,225, 4,375, 6,125, 30,62515 in total

Arithmetic

Previous number30,624

Next number30,626

Double61,250

Half15,312.5

Square937,890,625

Cube28,722,900,390,625

Square root175exact

Cube root31.286623728≈

Negation-30,625

Reciprocal0.0000326531≈

Representations

Decimal30,625

Binary11101111010000115 bits

Octal73641

Hexadecimal77A1

Base 36NMP

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

In wordsthirty thousand, six hundred and twenty-five

Ordinalthirty thousand, six hundred and twenty-fifth

Scientific notation3.0625 × 10^4

Engineering notation30.625 × 10^3

In other bases

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

Quinary1440000base 5; one hand: 7 digits

Septenary155200base 7: 6 digits

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

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

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

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

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

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

Bit-level

0111011110100001

Bit length15 bitsto write the magnitude

Set bits9the population count, or Hamming weight

Zero bits6within that length

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

Highest set bitbit 14worth 16,384

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes277 a1

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

At each machine width

16-bit0111011110100001

32-bit00000000000000000111011110100001

64-bit0000000000000000000000000000000000000000000000000111011110100001

One's complement1000100001011110at 16 bits, every bit flipped

Bits reversed1000010111101110at 16 bits

Rotated left by 11110111101000010at 16 bits, wrapping

Shifted left by 11110111101000010= 61,250, no wrap

Shifted right by 111101111010000= 15,312, discarding the low bit

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

Nearest landmarks

Next prime30,631+6

Previous prime30,593−32

Distance to nearest prime6

Nearest square below30,625

Nearest square above30,976

Powers & multiples

30,625 to the power 2937,890,625

30,625 to the power 328,722,900,390,625

30,625 to the power 4879,638,824,462,890,625

30,625 to the power 526,938,938,999,176,025,390,625

First ten multiples30,625, 61,250, 91,875, 122,500, 153,125, 183,750, 214,375, 245,000, 275,625, 306,250

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

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 1

Divisible by 4No, remainder 1

Divisible by 5Yes

Divisible by 6No, remainder 1

Divisible by 7Yes

Divisible by 8No, remainder 1

Divisible by 9No, remainder 7

Divisible by 10No, remainder 5

Divisible by 11No, remainder 1

Divisible by 12No, remainder 1

Divisible by 100No, remainder 25

Collatz (3n + 1) trajectory

Steps to reach 185the total stopping time

Highest value reached91,8763× the starting value

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

First steps30,625 → 91,876 → 45,938 → 22,969 → 68,908 → 34,454 → 17,227 → 51,682 → 25,841 → 77,524 → …

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

As a percentage & fraction

As a percentage3,062,500%

30,625% as a decimal306.25

30,625% of 10030,625

30,625% of 1,000306,250

As a fraction of 10030,625/100

Read another way

As seconds8 hours, 30 minutes and 25 seconds

As bytes29.907 KiB

As a 24-bit colour#0077A1

Keep nerding

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