Recognised as Number

4,615,413

Positive
Odd
Composite
7 digits

4,615,413 is an odd 7-digit integer and a composite number. It has 8 divisors and a digital root of 6.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value4,615,413

Digit count7

Digit sum24

Digit product1,440

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

Digital root6repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3 × 11 × 139,861

Distinct prime factors33, 11, 139,861

Number of divisors8

Sum of divisors σ(n)6,713,376

Aliquot sum2,097,963sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)2,797,200integers below n that share no factor with it

Carmichael function λ(n)139,860the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,797,200

Möbius function μ(n)−13 distinct prime factors, an odd number of them

SquarefreeYesno repeated prime factor

All divisors1, 3, 11, 33, 139,861, 419,583, 1,538,471, 4,615,4138 in total

Arithmetic

Previous number4,615,412

Next number4,615,414

Double9,230,826

Half2,307,706.5

Square21,302,037,160,569

Cube98,317,699,237,373,249,997

Square root2,148.351228268≈irrational, shown to 9 decimal places

Cube root166.495892187≈

Negation-4,615,413

Reciprocal2.16665334 × 10^-7≈

Representations

Decimal4,615,413

Binary1000110011011001111010123 bits

Octal21466365

Hexadecimal466CF5

Base 362QX9X

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

In wordsfour million, six hundred and fifteen thousand, four hundred and thirteen

Ordinalfour million, six hundred and fifteen thousand, four hundred and thirteenth

Scientific notation4.615413 × 10^6

Engineering notation4.615413 × 10^6

In other bases

Ternary22200111011020base 3; the most digit-efficient integer base after e: 14 digits

Quinary2140143123base 5; one hand: 10 digits

Septenary54142005base 7: 8 digits

Nonary8614136base 9; each digit is two ternary digits: 7 digits

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

Vigesimal18giadbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits

Sexagesimal21:22:3:33base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000010001100110110011110101

Bit length23 bitsto write the magnitude

Set bits13the population count, or Hamming weight

Zero bits10within that length

Bit parityodd13 set bits, so odd; 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

Bytes346 6c f5

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

At each machine width

32-bit00000000010001100110110011110101

64-bit0000000000000000000000000000000000000000010001100110110011110101

One's complement11111111101110011001001100001010at 32 bits, every bit flipped

Bits reversed10101111001101100110001000000000at 32 bits

Rotated left by 100000000100011001101100111101010at 32 bits, wrapping

Shifted left by 1100011001101100111101010= 9,230,826, no wrap

Shifted right by 11000110011011001111010= 2,307,706, discarding the low bit

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

Nearest landmarks

Next prime4,615,439+26

Previous prime4,615,409−4

Distance to nearest prime4

Nearest square below4,613,904

Nearest square above4,618,201

Powers & multiples

4,615,413 to the power 221,302,037,160,569

4,615,413 to the power 398,317,699,237,373,249,997

4,615,413 to the power 4453,776,787,190,262,583,888,403,761

4,615,413 to the power 52,094,367,282,696,171,403,092,129,267,768,293

First ten multiples4,615,413, 9,230,826, 13,846,239, 18,461,652, 23,077,065, 27,692,478, 32,307,891, 36,923,304, 41,538,717, 46,154,130

Powers of twoBetween 2^22 (4,194,304) and 2^23 (8,388,608)

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3Yes

Divisible by 4No, remainder 1

Divisible by 5No, remainder 3

Divisible by 6No, remainder 3

Divisible by 7No, remainder 5

Divisible by 8No, remainder 5

Divisible by 9No, remainder 6

Divisible by 10No, remainder 3

Divisible by 11Yes

Divisible by 12No, remainder 9

Divisible by 100No, remainder 13

Collatz (3n + 1) trajectory

Steps to reach 1211the total stopping time

Highest value reached13,846,2403× the starting value

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

First steps4,615,413 → 13,846,240 → 6,923,120 → 3,461,560 → 1,730,780 → 865,390 → 432,695 → 1,298,086 → 649,043 → 1,947,130 → …

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

As a percentage & fraction

As a percentage461,541,300%

4,615,413% as a decimal46,154.13

4,615,413% of 1004,615,413

4,615,413% of 1,00046,154,130

As a fraction of 1004,615,413/100

Read another way

As seconds53 days, 10 hours and 3 minutes

As bytes4.402 MiB

As a 24-bit colour#466CF5

Keep nerding

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