Recognised as Number
40,698
- Positive
- Even
- Composite
- 5 digits
40,698 is an even 5-digit integer and a composite number. It has 48 divisors and a digital root of 9.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value40,698
Digit count5
Digit sum27
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2 × 3^2 × 7 × 17 × 19
Distinct prime factors52, 3, 7, 17, 19
Number of divisors48
Sum of divisors σ(n)112,320
Aliquot sum71,622sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)10,368integers below n that share no factor with it
Carmichael function λ(n)144the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 10,368
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 3, 6, 7, 9, 14, 17, 18, 19, 21, 34, 38, 42, 51, 57, 63, 102, 114, 119, 126, 133, 153, 171, 238, 266, 306, 323, 342, 357, 399, 646, 714, 798, 969, 1,071, 1,197, 1,938, 2,142, 2,261, 2,394, 2,907, 4,522, 5,814, 6,783, 13,566, 20,349, 40,69848 in total
Arithmetic
Representations
Decimal40,698
Binary100111101111101016 bits
Octal117372
Hexadecimal9EFA
Base 36VEI
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsforty thousand, six hundred and ninety-eight
Ordinalforty thousand, six hundred and ninety-eighth
Scientific notation4.0698 × 10^4
Engineering notation40.698 × 10^3
In other bases
Ternary2001211100base 3; the most digit-efficient integer base after e: 10 digits
Quinary2300243base 5; one hand: 7 digits
Septenary226440base 7: 6 digits
Nonary61740base 9; each digit is two ternary digits: 5 digits
Duodecimal1b676base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal51eibase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal11:18:18base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary1T01TT11100digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11110001100001110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1001111011111010
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 even
Highest set bitbit 15worth 32,768
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes29e fa
Gray code1101000110000111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1001111011111010
32-bit00000000000000001001111011111010
64-bit0000000000000000000000000000000000000000000000001001111011111010
One's complement0110000100000101at 16 bits, every bit flipped
Bits reversed0101111101111001at 16 bits
Rotated left by 10011110111110101at 16 bits, wrapping
Shifted left by 110011110111110100= 81,396, no wrap
Shifted right by 1100111101111101= 20,349, discarding the low bit
These bits as a double2.01074837 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
40,698 to the power 21,656,327,204
40,698 to the power 367,409,204,548,392
40,698 to the power 42,743,419,806,710,457,616
40,698 to the power 5111,651,699,293,502,204,055,968
First ten multiples40,698, 81,396, 122,094, 162,792, 203,490, 244,188, 284,886, 325,584, 366,282, 406,980
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 3
Divisible by 6Yes
Divisible by 7Yes
Divisible by 8No, remainder 2
Divisible by 9Yes
Divisible by 10No, remainder 8
Divisible by 11No, remainder 9
Divisible by 12No, remainder 6
Divisible by 100No, remainder 98
Collatz (3n + 1) trajectory
Steps to reach 1181the total stopping time
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps40,698 → 20,349 → 61,048 → 30,524 → 15,262 → 7,631 → 22,894 → 11,447 → 34,342 → 17,171 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage4,069,800%
40,698% as a decimal406.98
40,698% of 10040,698
40,698% of 1,000406,980
As a fraction of 10040,698/100
Read another way
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from 40,698
Nerdulate something else
Nothing in mind? Surprise me · today’s page