Nerdulator> put something in

Recognised as Number

42,954

  • Positive
  • Even
  • Composite
  • 5 digits

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

Number properties

ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value42,954
Digit count5
Digit sum24
Digit product1,440
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root6repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 3 × 7,159
Distinct prime factors32, 3, 7,159
Number of divisors8
Sum of divisors σ(n)85,920
Aliquot sum42,966sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)14,316integers below n that share no factor with it
Carmichael function λ(n)7,158the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 14,316
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 3, 6, 7,159, 14,318, 21,477, 42,9548 in total

Arithmetic

Previous number42,953
Next number42,955
Double85,908
Half21,477
Square root207.253468005≈irrational, shown to 9 decimal places
Cube root35.021483409≈
Negation-42,954
Reciprocal0.0000232807≈

Representations

Decimal42,954
Binary101001111100101016 bits
Octal123712
HexadecimalA7CA
Base 36X56
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsforty-two thousand, nine hundred and fifty-four
Ordinalforty-two thousand, nine hundred and fifty-fourth
Scientific notation4.2954 × 10^4
Engineering notation42.954 × 10^3

In other bases

Ternary2011220220base 3; the most digit-efficient integer base after e: 10 digits
Quinary2333304base 5; one hand: 7 digits
Septenary236142base 7: 6 digits
Nonary64826base 9; each digit is two ternary digits: 5 digits
Duodecimal20a36base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal577ebase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal11:55:54base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary1T1TT0T10T0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11111100011011110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

1010011111001010
Bit length16 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits7within that length
Bit parityodd9 set bits, so odd; not the same as the number itself being even
Highest set bitbit 15worth 32,768
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes2a7 ca
Gray code1111010000101111n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1010011111001010
32-bit00000000000000001010011111001010
64-bit0000000000000000000000000000000000000000000000001010011111001010
One's complement0101100000110101at 16 bits, every bit flipped
Bits reversed0101001111100101at 16 bits
Rotated left by 10100111110010101at 16 bits, wrapping
Shifted left by 110100111110010100= 85,908, no wrap
Shifted right by 1101001111100101= 21,477, discarding the low bit
These bits as a double2.12220958 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime42,961+7
Previous prime42,953−1
Distance to nearest prime1
Nearest square below42,849
Nearest square above43,264

Powers & multiples

42,954 to the power 21,845,046,116
42,954 to the power 379,252,110,866,664
42,954 to the power 43,404,195,170,166,685,456
42,954 to the power 5146,223,799,339,339,807,077,024
First ten multiples42,954, 85,908, 128,862, 171,816, 214,770, 257,724, 300,678, 343,632, 386,586, 429,540
Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)

Divisibility tests

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

Collatz (3n + 1) trajectory

Steps to reach 175the total stopping time
Highest value reached64,4321× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps42,954 → 21,477 → 64,432 → 32,216 → 16,108 → 8,054 → 4,027 → 12,082 → 6,041 → 18,124 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage4,295,400%
42,954% as a decimal429.54
42,954% of 10042,954
42,954% of 1,000429,540
As a fraction of 10042,954/100

Read another way

As bytes41.947 KiB
As a 24-bit colour#00A7CA

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