Nerdulator> put something in

Recognised as Number

40,695

  • Positive
  • Odd
  • Composite
  • 5 digits

40,695 is an odd 5-digit integer and a composite number. It has 8 divisors and a digital root of 6.

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value40,695
Digit count5
Digit sum24
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times 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 factorisation3 × 5 × 2,713
Distinct prime factors33, 5, 2,713
Number of divisors8
Sum of divisors σ(n)65,136
Aliquot sum24,441sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)21,696integers below n that share no factor with it
Carmichael function λ(n)2,712the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 21,696
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 3, 5, 15, 2,713, 8,139, 13,565, 40,6958 in total

Arithmetic

Previous number40,694
Next number40,696
Double81,390
Square root201.730017598≈irrational, shown to 9 decimal places
Cube root34.396454926≈
Negation-40,695
Reciprocal0.000024573≈

Representations

Decimal40,695
Binary100111101111011116 bits
Octal117367
Hexadecimal9EF7
Base 36VEF
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsforty thousand, six hundred and ninety-five
Ordinalforty thousand, six hundred and ninety-fifth
Scientific notation4.0695 × 10^4
Engineering notation40.695 × 10^3

In other bases

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

Bit-level

1001111011110111
Bit length16 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits4within that length
Bit parityeven12 set bits, so even; 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 f7
Gray code1101000110001100n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1001111011110111
32-bit00000000000000001001111011110111
64-bit0000000000000000000000000000000000000000000000001001111011110111
One's complement0110000100001000at 16 bits, every bit flipped
Bits reversed1110111101111001at 16 bits
Rotated left by 10011110111101111at 16 bits, wrapping
Shifted left by 110011110111101110= 81,390, no wrap
Shifted right by 1100111101111011= 20,347, discarding the low bit
These bits as a double2.01060015 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime40,697+2
Previous prime40,693−2
Distance to nearest prime2
Nearest square below40,401
Nearest square above40,804

Powers & multiples

40,695 to the power 21,656,083,025
40,695 to the power 367,394,298,702,375
40,695 to the power 42,742,610,985,693,150,625
40,695 to the power 5111,610,554,062,782,764,684,375
First ten multiples40,695, 81,390, 122,085, 162,780, 203,475, 244,170, 284,865, 325,560, 366,255, 406,950
Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)

Divisibility tests

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

Collatz (3n + 1) trajectory

Steps to reach 175the total stopping time
Highest value reached274,6966× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps40,695 → 122,086 → 61,043 → 183,130 → 91,565 → 274,696 → 137,348 → 68,674 → 34,337 → 103,012 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage4,069,500%
40,695% as a decimal406.95
40,695% of 10040,695
40,695% of 1,000406,950
As a fraction of 10040,695/100

Read another way

As bytes39.741 KiB
As a 24-bit colour#009EF7

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