Nerdulator> put something in

Recognised as Number

4,681,241

  • Positive
  • Odd
  • Prime
  • 7 digits

4,681,241 is an odd 7-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 value4,681,241
Digit count7
Digit sum26
Digit product1,536
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

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

Arithmetic

Previous number4,681,240
Next number4,681,242
Double9,362,482
Cube102,584,796,259,848,480,521
Square root2,163.617572493≈irrational, shown to 9 decimal places
Cube root167.283715794≈
Negation-4,681,241
Reciprocal2.13618568 × 10^-7≈

Representations

Decimal4,681,241
Binary1000111011011100001100123 bits
Octal21667031
Hexadecimal476E19
Base 362SC2H
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfour million, six hundred and eighty-one thousand, two hundred and forty-one
Ordinalfour million, six hundred and eighty-one thousand, two hundred and forty-first
Scientific notation4.681241 × 10^6
Engineering notation4.681241 × 10^6

In other bases

Ternary22210211110022base 3; the most digit-efficient integer base after e: 14 digits
Quinary2144244431base 5; one hand: 10 digits
Septenary54534635base 7: 8 digits
Nonary8724408base 9; each digit is two ternary digits: 7 digits
Duodecimal1699075base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal195321base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal21:40:20:41base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary100T11T1111010Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10110001011001001101001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000010001110110111000011001
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
Bytes347 6e 19
Gray code11001001101100100010101n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000010001110110111000011001
64-bit0000000000000000000000000000000000000000010001110110111000011001
One's complement11111111101110001001000111100110at 32 bits, every bit flipped
Bits reversed10011000011101101110001000000000at 32 bits
Rotated left by 100000000100011101101110000110010at 32 bits, wrapping
Shifted left by 1100011101101110000110010= 9,362,482, no wrap
Shifted right by 11000111011011100001100= 2,340,620, discarding the low bit
These bits as a double2.31284036 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime4,681,253+12
Previous prime4,681,211−30
Distance to nearest prime0, it is prime
Nearest square below4,678,569
Nearest square above4,682,896

Powers & multiples

4,681,241 to the power 221,914,017,300,081
4,681,241 to the power 3102,584,796,259,848,480,521
4,681,241 to the power 4480,224,154,228,249,360,802,606,561
4,681,241 to the power 52,248,044,999,963,604,266,012,954,740,222,201
First ten multiples4,681,241, 9,362,482, 14,043,723, 18,724,964, 23,406,205, 28,087,446, 32,768,687, 37,449,928, 42,131,169, 46,812,410
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 2
Divisible by 4No, remainder 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 5
Divisible by 8No, remainder 1
Divisible by 9No, remainder 8
Divisible by 10No, remainder 1
Divisible by 11No, remainder 4
Divisible by 12No, remainder 5
Divisible by 100No, remainder 41

Collatz (3n + 1) trajectory

Steps to reach 1136the total stopping time
Highest value reached15,799,1923× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps4,681,241 → 14,043,724 → 7,021,862 → 3,510,931 → 10,532,794 → 5,266,397 → 15,799,192 → 7,899,596 → 3,949,798 → 1,974,899 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage468,124,100%
4,681,241% as a decimal46,812.41
4,681,241% of 1004,681,241
4,681,241% of 1,00046,812,410
As a fraction of 1004,681,241/100

Read another way

As bytes4.464 MiB
As a 24-bit colour#476E19

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