Nerdulator> put something in

Recognised as Number

14,954

  • Positive
  • Even
  • Composite
  • 5 digits

14,954 is an even 5-digit integer and a composite number. It has 4 divisors and a digital root of 5.

Number properties

ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value14,954
Digit count5
Digit sum23
Digit product720
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 7,477
Distinct prime factors22, 7,477
Number of divisors4
Sum of divisors σ(n)22,434
Aliquot sum7,480sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)7,476integers below n that share no factor with it
Carmichael function λ(n)7,476the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 7,477, 14,9544 in total

Arithmetic

Previous number14,953
Next number14,955
Double29,908
Half7,477
Square root122.286548729≈irrational, shown to 9 decimal places
Cube root24.636884761≈
Negation-14,954
Reciprocal0.0000668717≈

Representations

Decimal14,954
Binary1110100110101014 bits
Octal35152
Hexadecimal3A6A
Base 36BJE
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfourteen thousand, nine hundred and fifty-four
Ordinalfourteen thousand, nine hundred and fifty-fourth
Scientific notation1.4954 × 10^4
Engineering notation14.954 × 10^3

In other bases

Ternary202111212base 3; the most digit-efficient integer base after e: 9 digits
Quinary434304base 5; one hand: 6 digits
Septenary61412base 7: 5 digits
Nonary22455base 9; each digit is two ternary digits: 5 digits
Duodecimal87a2base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits
Vigesimal1h7ebase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal4:9:14base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary1T10TTT0TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100111110111110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

0011101001101010
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 even
Highest set bitbit 13worth 8,192
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes23a 6a
Gray code10011101011111n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit0011101001101010
32-bit00000000000000000011101001101010
64-bit0000000000000000000000000000000000000000000000000011101001101010
One's complement1100010110010101at 16 bits, every bit flipped
Bits reversed0101011001011100at 16 bits
Rotated left by 10111010011010100at 16 bits, wrapping
Shifted left by 1111010011010100= 29,908, no wrap
Shifted right by 11110100110101= 7,477, discarding the low bit
These bits as a double7.38825767 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime14,957+3
Previous prime14,951−3
Distance to nearest prime3
Nearest square below14,884
Nearest square above15,129

Powers & multiples

14,954 to the power 2223,622,116
14,954 to the power 33,344,045,122,664
14,954 to the power 450,006,850,764,317,456
14,954 to the power 5747,802,446,329,603,237,024
First ten multiples14,954, 29,908, 44,862, 59,816, 74,770, 89,724, 104,678, 119,632, 134,586, 149,540
Powers of twoBetween 2^13 (8,192) and 2^14 (16,384)

Divisibility tests

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

Collatz (3n + 1) trajectory

Steps to reach 189the total stopping time
Highest value reached22,4321× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps14,954 → 7,477 → 22,432 → 11,216 → 5,608 → 2,804 → 1,402 → 701 → 2,104 → 1,052 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage1,495,400%
14,954% as a decimal149.54
14,954% of 10014,954
14,954% of 1,000149,540
As a fraction of 10014,954/100

Read another way

As bytes14.604 KiB
As a 24-bit colour#003A6A

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