Nerdulator> put something in

Recognised as Number

4,846,357

  • Positive
  • Odd
  • Prime
  • 7 digits

4,846,357 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 1.

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value4,846,357
Digit count7
Digit sum37
Digit product80,640
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation4,846,357
Distinct prime factors14,846,357
Number of divisors2
Sum of divisors σ(n)4,846,358
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)4,846,356integers below n that share no factor with it
Carmichael function λ(n)4,846,356the 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, 4,846,3572 in total

Arithmetic

Previous number4,846,356
Next number4,846,358
Double9,692,714
Cube113,827,240,648,735,061,293
Square root2,201.444298637≈irrational, shown to 9 decimal places
Cube root169.227835979≈
Negation-4,846,357
Reciprocal2.06340556 × 10^-7≈

Representations

Decimal4,846,357
Binary1001001111100110001010123 bits
Octal22371425
Hexadecimal49F315
Base 362VVH1
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfour million, eight hundred and forty-six thousand, three hundred and fifty-seven
Ordinalfour million, eight hundred and forty-six thousand, three hundred and fifty-seventh
Scientific notation4.846357 × 10^6
Engineering notation4.846357 × 10^6

In other bases

Ternary100010012221201base 3; the most digit-efficient integer base after e: 15 digits
Quinary2220040412base 5; one hand: 10 digits
Septenary56123215base 7: 8 digits
Nonary10105851base 9; each digit is two ternary digits: 8 digits
Duodecimal1758731base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal1a5fhhbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal22:26:12:37base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1000101T000TT01digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10111100011011100010101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000010010011111001100010101
Bit length23 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits11within that length
Bit parityeven12 set bits, so even; not the same as the number itself being odd
Highest set bitbit 22worth 4,194,304
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes349 f3 15
Gray code11011010000101010011111n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000010010011111001100010101
64-bit0000000000000000000000000000000000000000010010011111001100010101
One's complement11111111101101100000110011101010at 32 bits, every bit flipped
Bits reversed10101000110011111001001000000000at 32 bits
Rotated left by 100000000100100111110011000101010at 32 bits, wrapping
Shifted left by 1100100111110011000101010= 9,692,714, no wrap
Shifted right by 11001001111100110001010= 2,423,178, discarding the low bit
These bits as a double2.3944185 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime4,846,367+10
Previous prime4,846,339−18
Distance to nearest prime0, it is prime
Nearest square below4,844,401
Nearest square above4,848,804

Powers & multiples

4,846,357 to the power 223,487,176,171,449
4,846,357 to the power 3113,827,240,648,735,061,293
4,846,357 to the power 4551,647,444,508,681,705,442,759,601
4,846,357 to the power 52,673,480,454,226,761,143,944,456,091,623,557
First ten multiples4,846,357, 9,692,714, 14,539,071, 19,385,428, 24,231,785, 29,078,142, 33,924,499, 38,770,856, 43,617,213, 48,463,570
Powers of twoBetween 2^22 (4,194,304) and 2^23 (8,388,608)

Divisibility tests

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

Collatz (3n + 1) trajectory

Steps to reach 169the total stopping time
Highest value reached14,539,0723× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps4,846,357 → 14,539,072 → 7,269,536 → 3,634,768 → 1,817,384 → 908,692 → 454,346 → 227,173 → 681,520 → 340,760 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage484,635,700%
4,846,357% as a decimal48,463.57
4,846,357% of 1004,846,357
4,846,357% of 1,00048,463,570
As a fraction of 1004,846,357/100

Read another way

As bytes4.622 MiB
As a 24-bit colour#49F315

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