Nerdulator> put something in

Recognised as Number

11,459

  • Positive
  • Odd
  • Composite
  • 5 digits

11,459 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 value11,459
Digit count5
Digit sum20
Digit product180
Multiplicative persistence2times 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 factorisation7 × 1,637
Distinct prime factors27, 1,637
Number of divisors4
Sum of divisors σ(n)13,104
Aliquot sum1,645sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)9,816integers below n that share no factor with it
Carmichael function λ(n)4,908the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 9,816
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 7, 1,637, 11,4594 in total

Arithmetic

Previous number11,458
Next number11,460
Double22,918
Square root107.046718773≈irrational, shown to 9 decimal places
Cube root22.544930793≈
Negation-11,459
Reciprocal0.0000872676≈

Representations

Decimal11,459
Binary1011001100001114 bits
Octal26303
Hexadecimal2CC3
Base 368UB
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordseleven thousand, four hundred and fifty-nine
Ordinaleleven thousand, four hundred and fifty-ninth
Scientific notation1.1459 × 10^4
Engineering notation11.459 × 10^3

In other bases

Ternary120201102base 3; the most digit-efficient integer base after e: 9 digits
Quinary331314base 5; one hand: 6 digits
Septenary45260base 7: 5 digits
Nonary16642base 9; each digit is two ternary digits: 5 digits
Duodecimal676bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits
Vigesimal18cjbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal3:10:59base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary1TT1T0111Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary111110111000111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

0010110011000011
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
Bytes22c c3
Gray code11101010100010n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit0010110011000011
32-bit00000000000000000010110011000011
64-bit0000000000000000000000000000000000000000000000000010110011000011
One's complement1101001100111100at 16 bits, every bit flipped
Bits reversed1100001100110100at 16 bits
Rotated left by 10101100110000110at 16 bits, wrapping
Shifted left by 1101100110000110= 22,918, no wrap
Shifted right by 11011001100001= 5,729, discarding the low bit
These bits as a double5.66149824 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime11,467+8
Previous prime11,447−12
Distance to nearest prime8
Nearest square below11,449
Nearest square above11,664

Powers & multiples

11,459 to the power 2131,308,681
11,459 to the power 31,504,666,175,579
11,459 to the power 417,241,969,705,959,761
11,459 to the power 5197,575,730,860,592,901,299
First ten multiples11,459, 22,918, 34,377, 45,836, 57,295, 68,754, 80,213, 91,672, 103,131, 114,590
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 3
Divisible by 5No, remainder 4
Divisible by 6No, remainder 5
Divisible by 7Yes
Divisible by 8No, remainder 3
Divisible by 9No, remainder 2
Divisible by 10No, remainder 9
Divisible by 11No, remainder 8
Divisible by 12No, remainder 11
Divisible by 100No, remainder 59

Collatz (3n + 1) trajectory

Steps to reach 129the total stopping time
Highest value reached51,5684× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps11,459 → 34,378 → 17,189 → 51,568 → 25,784 → 12,892 → 6,446 → 3,223 → 9,670 → 4,835 → …
Last steps… → 32 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage1,145,900%
11,459% as a decimal114.59
11,459% of 10011,459
11,459% of 1,000114,590
As a fraction of 10011,459/100

Read another way

As bytes11.19 KiB
As a 24-bit colour#002CC3

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 “11459” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.