Nerdulator> put something in

Recognised as Number

12,629

  • Positive
  • Odd
  • Composite
  • 5 digits

12,629 is an odd 5-digit integer and a composite number. It has 4 divisors and a digital root of 2.

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value12,629
Digit count5
Digit sum20
Digit product216
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation73 × 173
Distinct prime factors273, 173
Number of divisors4
Sum of divisors σ(n)12,876
Aliquot sum247sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)12,384integers below n that share no factor with it
Carmichael function λ(n)3,096the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 12,384
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 73, 173, 12,6294 in total

Arithmetic

Previous number12,628
Next number12,630
Double25,258
Square root112.378823628≈irrational, shown to 9 decimal places
Cube root23.287506426≈
Negation-12,629
Reciprocal0.0000791828≈

Representations

Decimal12,629
Binary1100010101010114 bits
Octal30525
Hexadecimal3155
Base 369QT
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwelve thousand, six hundred and twenty-nine
Ordinaltwelve thousand, six hundred and twenty-ninth
Scientific notation1.2629 × 10^4
Engineering notation12.629 × 10^3

In other bases

Ternary122022202base 3; the most digit-efficient integer base after e: 9 digits
Quinary401004base 5; one hand: 6 digits
Septenary51551base 7: 5 digits
Nonary18282base 9; each digit is two ternary digits: 5 digits
Duodecimal7385base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits
Vigesimal1bb9base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal3:30:29base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary1T0T100T1Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary111000101010101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

0011000101010101
Bit length14 bitsto write the magnitude
Set bits7the population count, or Hamming weight
Zero bits7within that length
Bit parityodd7 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 13worth 8,192
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes231 55
Gray code10100111111111n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit0011000101010101
32-bit00000000000000000011000101010101
64-bit0000000000000000000000000000000000000000000000000011000101010101
One's complement1100111010101010at 16 bits, every bit flipped
Bits reversed1010101010001100at 16 bits
Rotated left by 10110001010101010at 16 bits, wrapping
Shifted left by 1110001010101010= 25,258, no wrap
Shifted right by 11100010101010= 6,314, discarding the low bit
These bits as a double6.23955504 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime12,637+8
Previous prime12,619−10
Distance to nearest prime8
Nearest square below12,544
Nearest square above12,769

Powers & multiples

12,629 to the power 2159,491,641
12,629 to the power 32,014,219,934,189
12,629 to the power 425,437,583,548,872,881
12,629 to the power 5321,251,242,638,715,614,149
First ten multiples12,629, 25,258, 37,887, 50,516, 63,145, 75,774, 88,403, 101,032, 113,661, 126,290
Powers of twoBetween 2^13 (8,192) and 2^14 (16,384)

Divisibility tests

Divisible by 2No, remainder 1
Divisible by 3No, remainder 2
Divisible by 4No, remainder 1
Divisible by 5No, remainder 4
Divisible by 6No, remainder 5
Divisible by 7No, remainder 1
Divisible by 8No, remainder 5
Divisible by 9No, remainder 2
Divisible by 10No, remainder 9
Divisible by 11No, remainder 1
Divisible by 12No, remainder 5
Divisible by 100No, remainder 29

Collatz (3n + 1) trajectory

Steps to reach 132the total stopping time
Highest value reached37,8883× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps12,629 → 37,888 → 18,944 → 9,472 → 4,736 → 2,368 → 1,184 → 592 → 296 → 148 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage1,262,900%
12,629% as a decimal126.29
12,629% of 10012,629
12,629% of 1,000126,290
As a fraction of 10012,629/100

Read another way

As bytes12.333 KiB
As a 24-bit colour#003155

Keep nerding

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

Nerdulate something else

Nothing in mind? Surprise me · today’s page

Every value on this page was computed from “12629” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.