Recognised as Number

23,495

Positive
Odd
Composite
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value23,495

Digit count5

Digit sum23

Digit product1,080

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

Digital root5repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation5 × 37 × 127

Distinct prime factors35, 37, 127

Number of divisors8

Sum of divisors σ(n)29,184

Aliquot sum5,689sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)252the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 18,144

Möbius function μ(n)−13 distinct prime factors, an odd number of them

SquarefreeYesno repeated prime factor

All divisors1, 5, 37, 127, 185, 635, 4,699, 23,4958 in total

Arithmetic

Previous number23,494

Next number23,496

Double46,990

Half11,747.5

Square552,015,025

Cube12,969,593,012,375

Square root153.280788098≈irrational, shown to 9 decimal places

Cube root28.641239998≈

Negation-23,495

Reciprocal0.0000425622≈

Representations

Decimal23,495

Binary10110111100011115 bits

Octal55707

Hexadecimal5BC7

Base 36I4N

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

In wordstwenty-three thousand, four hundred and ninety-five

Ordinaltwenty-three thousand, four hundred and ninety-fifth

Scientific notation2.3495 × 10^4

Engineering notation23.495 × 10^3

In other bases

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

Quinary1222440base 5; one hand: 7 digits

Septenary125333base 7: 6 digits

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

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

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

Sexagesimal6:31:35base 60; Babylonian, and still how an hour and a circle are divided: 3 digits

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

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

Bit-level

0101101111000111

Bit length15 bitsto write the magnitude

Set bits10the population count, or Hamming weight

Zero bits5within that length

Bit parityeven10 set bits, so even; not the same as the number itself being odd

Highest set bitbit 14worth 16,384

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes25b c7

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

At each machine width

16-bit0101101111000111

32-bit00000000000000000101101111000111

64-bit0000000000000000000000000000000000000000000000000101101111000111

One's complement1010010000111000at 16 bits, every bit flipped

Bits reversed1110001111011010at 16 bits

Rotated left by 11011011110001110at 16 bits, wrapping

Shifted left by 11011011110001110= 46,990, no wrap

Shifted right by 110110111100011= 11,747, discarding the low bit

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

Nearest landmarks

Next prime23,497+2

Previous prime23,473−22

Distance to nearest prime2

Nearest square below23,409

Nearest square above23,716

Powers & multiples

23,495 to the power 2552,015,025

23,495 to the power 312,969,593,012,375

23,495 to the power 4304,720,587,825,750,625

23,495 to the power 57,159,410,210,966,010,934,375

First ten multiples23,495, 46,990, 70,485, 93,980, 117,475, 140,970, 164,465, 187,960, 211,455, 234,950

Powers of twoBetween 2^14 (16,384) and 2^15 (32,768)

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 2

Divisible by 4No, remainder 3

Divisible by 5Yes

Divisible by 6No, remainder 5

Divisible by 7No, remainder 3

Divisible by 8No, remainder 7

Divisible by 9No, remainder 5

Divisible by 10No, remainder 5

Divisible by 11No, remainder 10

Divisible by 12No, remainder 11

Divisible by 100No, remainder 95

Collatz (3n + 1) trajectory

Steps to reach 1175the total stopping time

Highest value reached338,74014× the starting value

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

First steps23,495 → 70,486 → 35,243 → 105,730 → 52,865 → 158,596 → 79,298 → 39,649 → 118,948 → 59,474 → …

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

As a percentage & fraction

As a percentage2,349,500%

23,495% as a decimal234.95

23,495% of 10023,495

23,495% of 1,000234,950

As a fraction of 10023,495/100

Read another way

As seconds6 hours, 31 minutes and 35 seconds

As bytes22.944 KiB

As a 24-bit colour#005BC7

Keep nerding

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