Nerdulator> put something in

Recognised as Number

40,577

  • Positive
  • Odd
  • Prime
  • 5 digits

40,577 is an odd 5-digit integer and a prime number. It has 2 divisors and a digital root of 5.

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value40,577
Digit count5
Digit sum23
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times 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 factorisation40,577
Distinct prime factors140,577
Number of divisors2
Sum of divisors σ(n)40,578
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)40,576integers below n that share no factor with it
Carmichael function λ(n)40,576the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)−11 distinct prime factor, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 40,5772 in total

Arithmetic

Previous number40,576
Next number40,578
Double81,154
Square root201.437335169≈irrational, shown to 9 decimal places
Cube root34.363177201≈
Negation-40,577
Reciprocal0.0000246445≈

Representations

Decimal40,577
Binary100111101000000116 bits
Octal117201
Hexadecimal9E81
Base 36VB5
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsforty thousand, five hundred and seventy-seven
Ordinalforty thousand, five hundred and seventy-seventh
Scientific notation4.0577 × 10^4
Engineering notation40.577 × 10^3

In other bases

Ternary2001122212base 3; the most digit-efficient integer base after e: 10 digits
Quinary2244302base 5; one hand: 7 digits
Septenary226205base 7: 6 digits
Nonary61585base 9; each digit is two ternary digits: 5 digits
Duodecimal1b595base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal518hbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal11:16:17base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary1T01TT000TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11110001110000001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

1001111010000001
Bit length16 bitsto write the magnitude
Set bits7the population count, or Hamming weight
Zero bits9within that length
Bit parityodd7 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 15worth 32,768
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes29e 81
Gray code1101000111000001n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1001111010000001
32-bit00000000000000001001111010000001
64-bit0000000000000000000000000000000000000000000000001001111010000001
One's complement0110000101111110at 16 bits, every bit flipped
Bits reversed1000000101111001at 16 bits
Rotated left by 10011110100000011at 16 bits, wrapping
Shifted left by 110011110100000010= 81,154, no wrap
Shifted right by 1100111101000000= 20,288, discarding the low bit
These bits as a double2.00477017 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime40,583+6
Previous prime40,559−18
Distance to nearest prime0, it is prime
Nearest square below40,401
Nearest square above40,804

Powers & multiples

40,577 to the power 21,646,492,929
40,577 to the power 366,809,743,580,033
40,577 to the power 42,710,938,965,246,999,041
40,577 to the power 5110,001,770,392,827,480,086,657
First ten multiples40,577, 81,154, 121,731, 162,308, 202,885, 243,462, 284,039, 324,616, 365,193, 405,770
Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)

Divisibility tests

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

Collatz (3n + 1) trajectory

Steps to reach 188the total stopping time
Highest value reached260,0086× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps40,577 → 121,732 → 60,866 → 30,433 → 91,300 → 45,650 → 22,825 → 68,476 → 34,238 → 17,119 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage4,057,700%
40,577% as a decimal405.77
40,577% of 10040,577
40,577% of 1,000405,770
As a fraction of 10040,577/100

Read another way

As bytes39.626 KiB
As a 24-bit colour#009E81

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