Recognised as Number

12,507

Positive
Odd
Composite
5 digits

12,507 is an odd 5-digit integer and a composite number. It has 8 divisors and a digital root of 6.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value12,507

Digit count5

Digit sum15

Digit product0zero, because one of the digits is zero

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

Digital root6repeated digit sum

PalindromicNoreads differently backwards

Happy numberYessquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3 × 11 × 379

Distinct prime factors33, 11, 379

Number of divisors8

Sum of divisors σ(n)18,240

Aliquot sum5,733sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)1,890the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 7,560

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

SquarefreeYesno repeated prime factor

All divisors1, 3, 11, 33, 379, 1,137, 4,169, 12,5078 in total

Arithmetic

Previous number12,506

Next number12,508

Double25,014

Half6,253.5

Square156,425,049

Cube1,956,408,087,843

Square root111.834699445≈irrational, shown to 9 decimal places

Cube root23.212275509≈

Negation-12,507

Reciprocal0.0000799552≈

Representations

Decimal12,507

Binary1100001101101114 bits

Octal30333

Hexadecimal30DB

Base 369NF

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

In wordstwelve thousand, five hundred and seven

Ordinaltwelve thousand, five hundred and seventh

Scientific notation1.2507 × 10^4

Engineering notation12.507 × 10^3

In other bases

Ternary122011020base 3; the most digit-efficient integer base after e: 9 digits

Quinary400012base 5; one hand: 6 digits

Septenary51315base 7: 5 digits

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

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

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

Sexagesimal3:28:27base 60; Babylonian, and still how an hour and a circle are divided: 3 digits

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

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

Bit-level

0011000011011011

Bit length14 bitsto write the magnitude

Set bits8the population count, or Hamming weight

Zero bits6within that length

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

Highest set bitbit 13worth 8,192

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes230 db

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

At each machine width

16-bit0011000011011011

32-bit00000000000000000011000011011011

64-bit0000000000000000000000000000000000000000000000000011000011011011

One's complement1100111100100100at 16 bits, every bit flipped

Bits reversed1101101100001100at 16 bits

Rotated left by 10110000110110110at 16 bits, wrapping

Shifted left by 1110000110110110= 25,014, no wrap

Shifted right by 11100001101101= 6,253, discarding the low bit

These bits as a double6.17927903 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime12,511+4

Previous prime12,503−4

Distance to nearest prime4

Nearest square below12,321

Nearest square above12,544

Powers & multiples

12,507 to the power 2156,425,049

12,507 to the power 31,956,408,087,843

12,507 to the power 424,468,795,954,652,401

12,507 to the power 5306,031,231,004,837,579,307

First ten multiples12,507, 25,014, 37,521, 50,028, 62,535, 75,042, 87,549, 100,056, 112,563, 125,070

Powers of twoBetween 2^13 (8,192) and 2^14 (16,384)

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3Yes

Divisible by 4No, remainder 3

Divisible by 5No, remainder 2

Divisible by 6No, remainder 3

Divisible by 7No, remainder 5

Divisible by 8No, remainder 3

Divisible by 9No, remainder 6

Divisible by 10No, remainder 7

Divisible by 11Yes

Divisible by 12No, remainder 3

Divisible by 100No, remainder 7

Collatz (3n + 1) trajectory

Steps to reach 1112the total stopping time

Highest value reached94,9847× the starting value

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

First steps12,507 → 37,522 → 18,761 → 56,284 → 28,142 → 14,071 → 42,214 → 21,107 → 63,322 → 31,661 → …

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

As a percentage & fraction

As a percentage1,250,700%

12,507% as a decimal125.07

12,507% of 10012,507

12,507% of 1,000125,070

As a fraction of 10012,507/100

Read another way

As seconds3 hours, 28 minutes and 27 seconds

As bytes12.214 KiB

As a 24-bit colour#0030DB

Keep nerding

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