Recognised as Number

12,495

Positive
Odd
Composite
5 digits

12,495 is an odd 5-digit integer and a composite number. It has 24 divisors and a digital root of 3.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value12,495

Digit count5

Digit sum21

Digit product360

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

Digital root3repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberYesdivisible by its own digit sum

Factors & divisors

Prime factorisation3 × 5 × 7^2 × 17

Distinct prime factors43, 5, 7, 17

Number of divisors24

Sum of divisors σ(n)24,624

Aliquot sum12,129sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

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

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

SquarefreeNohas a repeated prime factor

All divisors1, 3, 5, 7, 15, 17, 21, 35, 49, 51, 85, 105, 119, 147, 245, 255, 357, 595, 735, 833, 1,785, 2,499, 4,165, 12,49524 in total

Arithmetic

Previous number12,494

Next number12,496

Double24,990

Half6,247.5

Square156,125,025

Cube1,950,782,187,375

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

Cube root23.204849363≈

Negation-12,495

Reciprocal0.000080032≈

Representations

Decimal12,495

Binary1100001100111114 bits

Octal30317

Hexadecimal30CF

Base 369N3

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

In wordstwelve thousand, four hundred and ninety-five

Ordinaltwelve thousand, four hundred and ninety-fifth

Scientific notation1.2495 × 10^4

Engineering notation12.495 × 10^3

In other bases

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

Quinary344440base 5; one hand: 6 digits

Septenary51300base 7: 5 digits

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

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

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

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

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

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

Bit-level

0011000011001111

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 cf

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

At each machine width

16-bit0011000011001111

32-bit00000000000000000011000011001111

64-bit0000000000000000000000000000000000000000000000000011000011001111

One's complement1100111100110000at 16 bits, every bit flipped

Bits reversed1111001100001100at 16 bits

Rotated left by 10110000110011110at 16 bits, wrapping

Shifted left by 1110000110011110= 24,990, no wrap

Shifted right by 11100001100111= 6,247, discarding the low bit

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

Nearest landmarks

Next prime12,497+2

Previous prime12,491−4

Distance to nearest prime2

Nearest square below12,321

Nearest square above12,544

Powers & multiples

12,495 to the power 2156,125,025

12,495 to the power 31,950,782,187,375

12,495 to the power 424,375,023,431,250,625

12,495 to the power 5304,565,917,773,476,559,375

First ten multiples12,495, 24,990, 37,485, 49,980, 62,475, 74,970, 87,465, 99,960, 112,455, 124,950

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 5Yes

Divisible by 6No, remainder 3

Divisible by 7Yes

Divisible by 8No, remainder 7

Divisible by 9No, remainder 3

Divisible by 10No, remainder 5

Divisible by 11No, remainder 10

Divisible by 12No, remainder 3

Divisible by 100No, remainder 95

Collatz (3n + 1) trajectory

Steps to reach 1187the total stopping time

Highest value reached144,34011× the starting value

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

First steps12,495 → 37,486 → 18,743 → 56,230 → 28,115 → 84,346 → 42,173 → 126,520 → 63,260 → 31,630 → …

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

As a percentage & fraction

As a percentage1,249,500%

12,495% as a decimal124.95

12,495% of 10012,495

12,495% of 1,000124,950

As a fraction of 10012,495/100

Read another way

As seconds3 hours, 28 minutes and 15 seconds

As bytes12.202 KiB

As a 24-bit colour#0030CF

Keep nerding

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