Recognised as Number

46,995

Positive
Odd
Composite
5 digits

46,995 is an odd 5-digit integer and a composite number. It has 16 divisors and a digital root of 6.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value46,995

Digit count5

Digit sum33

Digit product9,720

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

Digital root6repeated digit sum

PalindromicNoreads differently backwards

Happy numberYessquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3 × 5 × 13 × 241

Distinct prime factors43, 5, 13, 241

Number of divisors16

Sum of divisors σ(n)81,312

Aliquot sum34,317sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

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

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

SquarefreeYesno repeated prime factor

All divisors1, 3, 5, 13, 15, 39, 65, 195, 241, 723, 1,205, 3,133, 3,615, 9,399, 15,665, 46,99516 in total

Arithmetic

Previous number46,994

Next number46,996

Double93,990

Half23,497.5

Square2,208,530,025

Cube103,789,868,524,875

Square root216.78330194≈irrational, shown to 9 decimal places

Cube root36.08698103≈

Negation-46,995

Reciprocal0.0000212789≈

Representations

Decimal46,995

Binary101101111001001116 bits

Octal133623

HexadecimalB793

Base 36109F

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

In wordsforty-six thousand, nine hundred and ninety-five

Ordinalforty-six thousand, nine hundred and ninety-fifth

Scientific notation4.6995 × 10^4

Engineering notation46.995 × 10^3

In other bases

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

Quinary3000440base 5; one hand: 7 digits

Septenary254004base 7: 6 digits

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

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

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

Sexagesimal13:3:15base 60; Babylonian, and still how an hour and a circle are divided: 3 digits

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

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

Bit-level

1011011110010011

Bit length16 bitsto write the magnitude

Set bits10the population count, or Hamming weight

Zero bits6within that length

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

Bytes2b7 93

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

At each machine width

16-bit1011011110010011

32-bit00000000000000001011011110010011

64-bit0000000000000000000000000000000000000000000000001011011110010011

One's complement0100100001101100at 16 bits, every bit flipped

Bits reversed1100100111101101at 16 bits

Rotated left by 10110111100100111at 16 bits, wrapping

Shifted left by 110110111100100110= 93,990, no wrap

Shifted right by 1101101111001001= 23,497, discarding the low bit

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

Nearest landmarks

Next prime46,997+2

Previous prime46,993−2

Distance to nearest prime2

Nearest square below46,656

Nearest square above47,089

Powers & multiples

46,995 to the power 22,208,530,025

46,995 to the power 3103,789,868,524,875

46,995 to the power 44,877,604,871,326,500,625

46,995 to the power 5229,223,040,927,988,896,871,875

First ten multiples46,995, 93,990, 140,985, 187,980, 234,975, 281,970, 328,965, 375,960, 422,955, 469,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 3

Divisible by 9No, remainder 6

Divisible by 10No, remainder 5

Divisible by 11No, remainder 3

Divisible by 12No, remainder 3

Divisible by 100No, remainder 95

Collatz (3n + 1) trajectory

Steps to reach 157the total stopping time

Highest value reached211,4804× the starting value

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

First steps46,995 → 140,986 → 70,493 → 211,480 → 105,740 → 52,870 → 26,435 → 79,306 → 39,653 → 118,960 → …

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

As a percentage & fraction

As a percentage4,699,500%

46,995% as a decimal469.95

46,995% of 10046,995

46,995% of 1,000469,950

As a fraction of 10046,995/100

Read another way

As seconds13 hours, 3 minutes and 15 seconds

As bytes45.894 KiB

As a 24-bit colour#00B793

Keep nerding

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