Nerdulator> put something in

Recognised as Number

46,997

  • Positive
  • Odd
  • Prime
  • 5 digits

46,997 is an odd 5-digit integer and a prime number. It has 2 divisors and a digital root of 8.

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value46,997
Digit count5
Digit sum35
Digit product13,608
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation46,997
Distinct prime factors146,997
Number of divisors2
Sum of divisors σ(n)46,998
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)46,996integers below n that share no factor with it
Carmichael function λ(n)46,996the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)−11 distinct prime factor, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 46,9972 in total

Arithmetic

Previous number46,996
Next number46,998
Double93,994
Square root216.787914792≈irrational, shown to 9 decimal places
Cube root36.08749295≈
Negation-46,997
Reciprocal0.000021278≈

Representations

Decimal46,997
Binary101101111001010116 bits
Octal133625
HexadecimalB795
Base 36109H
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsforty-six thousand, nine hundred and ninety-seven
Ordinalforty-six thousand, nine hundred and ninety-seventh
Scientific notation4.6997 × 10^4
Engineering notation46.997 × 10^3

In other bases

Ternary2101110122base 3; the most digit-efficient integer base after e: 10 digits
Quinary3000442base 5; one hand: 7 digits
Septenary254006base 7: 6 digits
Nonary71418base 9; each digit is two ternary digits: 5 digits
Duodecimal23245base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal5h9hbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal13:3:17base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary1T101111T0Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11100100010010101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

1011011110010101
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 95
Gray code1110110001011111n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1011011110010101
32-bit00000000000000001011011110010101
64-bit0000000000000000000000000000000000000000000000001011011110010101
One's complement0100100001101010at 16 bits, every bit flipped
Bits reversed1010100111101101at 16 bits
Rotated left by 10110111100101011at 16 bits, wrapping
Shifted left by 110110111100101010= 93,994, no wrap
Shifted right by 1101101111001010= 23,498, discarding the low bit
These bits as a double2.32196032 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime47,017+20
Previous prime46,993−4
Distance to nearest prime0, it is prime
Nearest square below46,656
Nearest square above47,089

Powers & multiples

46,997 to the power 22,208,718,009
46,997 to the power 3103,803,120,268,973
46,997 to the power 44,878,435,243,280,924,081
46,997 to the power 5229,271,821,128,473,589,034,757
First ten multiples46,997, 93,994, 140,991, 187,988, 234,985, 281,982, 328,979, 375,976, 422,973, 469,970
Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)

Divisibility tests

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

Collatz (3n + 1) trajectory

Steps to reach 157the total stopping time
Highest value reached140,9923× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps46,997 → 140,992 → 70,496 → 35,248 → 17,624 → 8,812 → 4,406 → 2,203 → 6,610 → 3,305 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage4,699,700%
46,997% as a decimal469.97
46,997% of 10046,997
46,997% of 1,000469,970
As a fraction of 10046,997/100

Read another way

As bytes45.896 KiB
As a 24-bit colour#00B795

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