Recognised as Number

35,499

Positive
Odd
Composite
5 digits

35,499 is an odd 5-digit integer and a composite number. It has 4 divisors and a digital root of 3.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value35,499

Digit count5

Digit sum30

Digit product4,860

Multiplicative persistence2times the digit product can be taken before one digit is left

Digital root3repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3 × 11,833

Distinct prime factors23, 11,833

Number of divisors4

Sum of divisors σ(n)47,336

Aliquot sum11,837sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)23,664integers below n that share no factor with it

Carmichael function λ(n)11,832the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 23,664

Möbius function μ(n)+12 distinct prime factors, an even number of them

SquarefreeYesno repeated prime factor

All divisors1, 3, 11,833, 35,4994 in total

Arithmetic

Previous number35,498

Next number35,500

Double70,998

Half17,749.5

Square1,260,179,001

Cube44,735,094,356,499

Square root188.411783071≈irrational, shown to 9 decimal places

Cube root32.865383656≈

Negation-35,499

Reciprocal0.0000281698≈

Representations

Decimal35,499

Binary100010101010101116 bits

Octal105253

Hexadecimal8AAB

Base 36RE3

Roman numeralNot defined above 3,999there is no agreed standard notation

In wordsthirty-five thousand, four hundred and ninety-nine

Ordinalthirty-five thousand, four hundred and ninety-ninth

Scientific notation3.5499 × 10^4

Engineering notation35.499 × 10^3

In other bases

Ternary1210200210base 3; the most digit-efficient integer base after e: 10 digits

Quinary2113444base 5; one hand: 7 digits

Septenary205332base 7: 6 digits

Nonary53623base 9; each digit is two ternary digits: 5 digits

Duodecimal18663base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits

Vigesimal48ejbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits

Sexagesimal9:51:39base 60; Babylonian, and still how an hour and a circle are divided: 3 digits

Balanced ternary1TT11T01T10digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed

Negabinary11001111111111111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

1000101010101011

Bit length16 bitsto write the magnitude

Set bits8the population count, or Hamming weight

Zero bits8within that length

Bit parityeven8 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

Bytes28a ab

Gray code1100111111111110n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1000101010101011

32-bit00000000000000001000101010101011

64-bit0000000000000000000000000000000000000000000000001000101010101011

One's complement0111010101010100at 16 bits, every bit flipped

Bits reversed1101010101010001at 16 bits

Rotated left by 10001010101010111at 16 bits, wrapping

Shifted left by 110001010101010110= 70,998, no wrap

Shifted right by 1100010101010101= 17,749, discarding the low bit

These bits as a double1.75388364 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime35,507+8

Previous prime35,491−8

Distance to nearest prime8

Nearest square below35,344

Nearest square above35,721

Powers & multiples

35,499 to the power 21,260,179,001

35,499 to the power 344,735,094,356,499

35,499 to the power 41,588,051,114,561,358,001

35,499 to the power 556,374,226,515,813,647,677,499

First ten multiples35,499, 70,998, 106,497, 141,996, 177,495, 212,994, 248,493, 283,992, 319,491, 354,990

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 5No, remainder 4

Divisible by 6No, remainder 3

Divisible by 7No, remainder 2

Divisible by 8No, remainder 3

Divisible by 9No, remainder 3

Divisible by 10No, remainder 9

Divisible by 11No, remainder 2

Divisible by 12No, remainder 3

Divisible by 100No, remainder 99

Collatz (3n + 1) trajectory

Steps to reach 1142the total stopping time

Highest value reached159,7484× the starting value

Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven

First steps35,499 → 106,498 → 53,249 → 159,748 → 79,874 → 39,937 → 119,812 → 59,906 → 29,953 → 89,860 → …

Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage3,549,900%

35,499% as a decimal354.99

35,499% of 10035,499

35,499% of 1,000354,990

As a fraction of 10035,499/100

Read another way

As seconds9 hours, 51 minutes and 39 seconds

As bytes34.667 KiB

As a 24-bit colour#008AAB

Keep nerding

Every link below is a page Nerdulator can generate from what it already knows about this value.