Recognised as Number

6,446,913

Positive
Odd
Composite
7 digits

6,446,913 is an odd 7-digit integer and a composite number. It has 16 divisors and a digital root of 6.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value6,446,913

Digit count7

Digit sum33

Digit product15,552

Multiplicative persistence3times 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 numberYesdivisible by its own digit sum

Factors & divisors

Prime factorisation3 × 11 × 347 × 563

Distinct prime factors43, 11, 347, 563

Number of divisors16

Sum of divisors σ(n)9,421,056

Aliquot sum2,974,143sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)3,889,040integers below n that share no factor with it

Carmichael function λ(n)486,130the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 3,889,040

Möbius function μ(n)+14 distinct prime factors, an even number of them

SquarefreeYesno repeated prime factor

All divisors1, 3, 11, 33, 347, 563, 1,041, 1,689, 3,817, 6,193, 11,451, 18,579, 195,361, 586,083, 2,148,971, 6,446,91316 in total

Arithmetic

Previous number6,446,912

Next number6,446,914

Double12,893,826

Half3,223,456.5

Square41,562,687,229,569

Cube267,951,028,615,242,370,497

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

Cube root186.116097019≈

Negation-6,446,913

Reciprocal1.55112997 × 10^-7≈

Representations

Decimal6,446,913

Binary1100010010111110100000123 bits

Octal30457501

Hexadecimal625F41

Base 363U6GX

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

In wordssix million, four hundred and forty-six thousand, nine hundred and thirteen

Ordinalsix million, four hundred and forty-six thousand, nine hundred and thirteenth

Scientific notation6.446913 × 10^6

Engineering notation6.446913 × 10^6

In other bases

Ternary110010112111120base 3; the most digit-efficient integer base after e: 15 digits

Quinary3122300123base 5; one hand: 10 digits

Septenary105540444base 7: 9 digits

Nonary13115446base 9; each digit is two ternary digits: 8 digits

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

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

Sexagesimal29:50:48:33base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000011000100101111101000001

Bit length23 bitsto write the magnitude

Set bits11the population count, or Hamming weight

Zero bits12within that length

Bit parityodd11 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

Bytes362 5f 41

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

At each machine width

32-bit00000000011000100101111101000001

64-bit0000000000000000000000000000000000000000011000100101111101000001

One's complement11111111100111011010000010111110at 32 bits, every bit flipped

Bits reversed10000010111110100100011000000000at 32 bits

Rotated left by 100000000110001001011111010000010at 32 bits, wrapping

Shifted left by 1110001001011111010000010= 12,893,826, no wrap

Shifted right by 11100010010111110100000= 3,223,456, discarding the low bit

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

Nearest landmarks

Next prime6,446,929+16

Previous prime6,446,863−50

Distance to nearest prime16

Nearest square below6,446,521

Nearest square above6,451,600

Powers & multiples

6,446,913 to the power 241,562,687,229,569

6,446,913 to the power 3267,951,028,615,242,370,497

6,446,913 to the power 41,727,456,969,742,978,036,507,925,761

6,446,913 to the power 511,136,764,795,176,611,762,277,421,191,625,793

First ten multiples6,446,913, 12,893,826, 19,340,739, 25,787,652, 32,234,565, 38,681,478, 45,128,391, 51,575,304, 58,022,217, 64,469,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 4

Divisible by 8No, remainder 1

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 172the total stopping time

Highest value reached19,340,7403× the starting value

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

First steps6,446,913 → 19,340,740 → 9,670,370 → 4,835,185 → 14,505,556 → 7,252,778 → 3,626,389 → 10,879,168 → 5,439,584 → 2,719,792 → …

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

As a percentage & fraction

As a percentage644,691,300%

6,446,913% as a decimal64,469.13

6,446,913% of 1006,446,913

6,446,913% of 1,00064,469,130

As a fraction of 1006,446,913/100

Read another way

As seconds74 days, 14 hours and 48 minutes

As bytes6.148 MiB

As a 24-bit colour#625F41

Keep nerding

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