Nerdulator> put something in

Recognised as Number

46,229

  • Positive
  • Odd
  • Prime
  • 5 digits

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

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value46,229
Digit count5
Digit sum23
Digit product864
Multiplicative persistence4times 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 factorisation46,229
Distinct prime factors146,229
Number of divisors2
Sum of divisors σ(n)46,230
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)46,228integers below n that share no factor with it
Carmichael function λ(n)46,228the 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,2292 in total

Arithmetic

Previous number46,228
Next number46,230
Double92,458
Square root215.009302124≈irrational, shown to 9 decimal places
Cube root35.88983814≈
Negation-46,229
Reciprocal0.0000216314≈

Representations

Decimal46,229
Binary101101001001010116 bits
Octal132225
HexadecimalB495
Base 36ZO5
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsforty-six thousand, two hundred and twenty-nine
Ordinalforty-six thousand, two hundred and twenty-ninth
Scientific notation4.6229 × 10^4
Engineering notation46.229 × 10^3

In other bases

Ternary2100102012base 3; the most digit-efficient integer base after e: 10 digits
Quinary2434404base 5; one hand: 7 digits
Septenary251531base 7: 6 digits
Nonary70365base 9; each digit is two ternary digits: 5 digits
Duodecimal22905base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal5fb9base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal12:50:29base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary1T10011T1TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11111010110010101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

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

At each machine width

16-bit1011010010010101
32-bit00000000000000001011010010010101
64-bit0000000000000000000000000000000000000000000000001011010010010101
One's complement0100101101101010at 16 bits, every bit flipped
Bits reversed1010100100101101at 16 bits
Rotated left by 10110100100101011at 16 bits, wrapping
Shifted left by 110110100100101010= 92,458, no wrap
Shifted right by 1101101001001010= 23,114, discarding the low bit
These bits as a double2.28401607 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime46,237+8
Previous prime46,219−10
Distance to nearest prime0, it is prime
Nearest square below46,225
Nearest square above46,656

Powers & multiples

46,229 to the power 22,137,120,441
46,229 to the power 398,796,940,866,989
46,229 to the power 44,567,283,779,340,034,481
46,229 to the power 5211,140,961,835,110,454,022,149
First ten multiples46,229, 92,458, 138,687, 184,916, 231,145, 277,374, 323,603, 369,832, 416,061, 462,290
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 4
Divisible by 6No, remainder 5
Divisible by 7No, remainder 1
Divisible by 8No, remainder 5
Divisible by 9No, remainder 5
Divisible by 10No, remainder 9
Divisible by 11No, remainder 7
Divisible by 12No, remainder 5
Divisible by 100No, remainder 29

Collatz (3n + 1) trajectory

Steps to reach 1145the total stopping time
Highest value reached138,6883× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps46,229 → 138,688 → 69,344 → 34,672 → 17,336 → 8,668 → 4,334 → 2,167 → 6,502 → 3,251 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage4,622,900%
46,229% as a decimal462.29
46,229% of 10046,229
46,229% of 1,000462,290
As a fraction of 10046,229/100

Read another way

As bytes45.146 KiB
As a 24-bit colour#00B495

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