Nerdulator> put something in

Recognised as Number

40,697

  • Positive
  • Odd
  • Prime
  • 5 digits

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

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value40,697
Digit count5
Digit sum26
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation40,697
Distinct prime factors140,697
Number of divisors2
Sum of divisors σ(n)40,698
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)40,696integers below n that share no factor with it
Carmichael function λ(n)40,696the 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,6972 in total

Arithmetic

Previous number40,696
Next number40,698
Double81,394
Square root201.734974657≈irrational, shown to 9 decimal places
Cube root34.3970184≈
Negation-40,697
Reciprocal0.0000245718≈

Representations

Decimal40,697
Binary100111101111100116 bits
Octal117371
Hexadecimal9EF9
Base 36VEH
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsforty thousand, six hundred and ninety-seven
Ordinalforty thousand, six hundred and ninety-seventh
Scientific notation4.0697 × 10^4
Engineering notation40.697 × 10^3

In other bases

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

Bit-level

1001111011111001
Bit length16 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits5within that length
Bit parityodd11 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 f9
Gray code1101000110000101n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1001111011111001
32-bit00000000000000001001111011111001
64-bit0000000000000000000000000000000000000000000000001001111011111001
One's complement0110000100000110at 16 bits, every bit flipped
Bits reversed1001111101111001at 16 bits
Rotated left by 10011110111110011at 16 bits, wrapping
Shifted left by 110011110111110010= 81,394, no wrap
Shifted right by 1100111101111100= 20,348, discarding the low bit
These bits as a double2.01069896 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime40,699+2
Previous prime40,693−4
Distance to nearest prime0, it is prime
Nearest square below40,401
Nearest square above40,804

Powers & multiples

40,697 to the power 21,656,245,809
40,697 to the power 367,404,235,688,873
40,697 to the power 42,743,150,179,830,064,481
40,697 to the power 5111,637,982,868,544,134,183,257
First ten multiples40,697, 81,394, 122,091, 162,788, 203,485, 244,182, 284,879, 325,576, 366,273, 406,970
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 6
Divisible by 8No, remainder 1
Divisible by 9No, remainder 8
Divisible by 10No, remainder 7
Divisible by 11No, remainder 8
Divisible by 12No, remainder 5
Divisible by 100No, remainder 97

Collatz (3n + 1) trajectory

Steps to reach 188the total stopping time
Highest value reached154,5283× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps40,697 → 122,092 → 61,046 → 30,523 → 91,570 → 45,785 → 137,356 → 68,678 → 34,339 → 103,018 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage4,069,700%
40,697% as a decimal406.97
40,697% of 10040,697
40,697% of 1,000406,970
As a fraction of 10040,697/100

Read another way

As bytes39.743 KiB
As a 24-bit colour#009EF9

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