Recognised as Number

3,466,913,218,560,000,002

Positive
Even
Composite
19 digits

3,466,913,218,560,000,002 is an even 19-digit integer and a composite number. It has 8 divisors and a digital root of 2.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value3,466,913,218,560,000,002

Digit count19

Digit sum56

Digit product0zero, because one of the digits is zero

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

Digital root2repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 509 × 3,405,612,198,978,389

Distinct prime factors32, 509, 3,405,612,198,978,389

Number of divisors8

Sum of divisors σ(n)5,210,586,664,436,936,700

Aliquot sum1,743,673,445,876,936,698sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)1,730,050,997,081,021,104integers below n that share no factor with it

Carmichael function λ(n)3,405,612,198,978,388the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,730,050,997,081,021,104

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

SquarefreeYesno repeated prime factor

All divisors1, 2, 509, 1,018, 3,405,612,198,978,389, 6,811,224,397,956,778, 1,733,456,609,280,000,001, 3,466,913,218,560,000,0028 in total

Arithmetic

Previous number3,466,913,218,560,000,001

Next number3,466,913,218,560,000,003

Double6,933,826,437,120,000,004

Square12,019,487,265,026,058,342,341,252,874,240,000,004

Cube41,670,519,279,432,423,673,955,625,858,146,366,012,444,558,622,720,000,008

Square root1,861,964,881≈irrational, shown to 9 decimal places

Cube root1,513,494≈

Negation-3,466,913,218,560,000,002

Representations

Decimal3,466,913,218,560,000,002

Binary1100000001110011110011001101000010101101100000000000000000001062 bits

Octal300347463205330000002

Hexadecimal301CF3342B600002

Base 36QC8M61FNY802

In wordsthree quintillion, four hundred and sixty-six quadrillion, nine hundred and thirteen trillion, two hundred and eighteen billion, five hundred and sixty million and two

Ordinalthree quintillion, four hundred and sixty-six quadrillion, nine hundred and thirteen trillion, two hundred and eighteen billion, five hundred and sixty million and second

Engineering notation3.466913 × 10^18

In other bases

Ternary212002122120111222211210201100210020002base 3; the most digit-efficient integer base after e: 39 digits

Quinary213040310222133102330000002base 5; one hand: 27 digits

Septenary6131004232154250556313base 7: 22 digits

Nonary25078514884721323202base 9; each digit is two ternary digits: 20 digits

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

Vigesimal22685ehc0000002base 20; hands and feet, and the Mayan and Yoruba systems: 15 digits

Sexagesimal5:44:1:6:22:13:20:0:0:0:2base 60; Babylonian, and still how an hour and a circle are divided: 11 digits

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

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

Bit-level

0011000000011100111100110011010000101011011000000000000000000010

Bit length62 bitsto write the magnitude

Set bits21the population count, or Hamming weight

Zero bits41within that length

Bit parityodd21 set bits, so odd; not the same as the number itself being even

Highest set bitbit 61worth 2,305,843,009,213,693,952

Lowest set bitbit 11 trailing zero

Power of twoNo

Bytes830 1c f3 34 2b 60 00 02

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

At each machine width

64-bit0011000000011100111100110011010000101011011000000000000000000010

One's complement1100111111100011000011001100101111010100100111111111111111111101at 64 bits, every bit flipped

Bits reversed0100000000000000000001101101010000101100110011110011100000001100at 64 bits

Rotated left by 10110000000111001111001100110100001010110110000000000000000000100at 64 bits, wrapping

Shifted left by 1110000000111001111001100110100001010110110000000000000000000100= 6,933,826,437,120,000,004, no wrap

Shifted right by 11100000001110011110011001101000010101101100000000000000000001= 1,733,456,609,280,000,001, discarding the low bit

These bits as a double6.25043019 × 10^-77≈IEEE-754 binary64 reinterpretation of the same 64 bits (normal)

Nearest landmarks

Next prime3,466,913,218,560,000,043+41

Previous prime3,466,913,218,559,999,981−21

Distance to nearest prime21

Nearest square below3,466,913,218,077,344,161

Nearest square above3,466,913,221,801,273,924

Powers & multiples

3,466,913,218,560,000,002 to the power 212,019,487,265,026,058,342,341,252,874,240,000,004

3,466,913,218,560,000,002 to the power 3416705192794324236739556258581… (56 digits)

3,466,913,218,560,000,002 to the power 4144468074114123596052836077449… (75 digits)

3,466,913,218,560,000,002 to the power 5500858275806160857434115385314… (93 digits)

First ten multiples3,466,913,218,560,000,002, 6,933,826,437,120,000,004, 10,400,739,655,680,000,006, 13,867,652,874,240,000,008, 17,334,566,092,800,000,010, 20,801,479,311,360,000,012, 24,268,392,529,920,000,014, 27,735,305,748,480,000,016, 31,202,218,967,040,000,018, 34,669,132,185,600,000,020

Powers of twoBetween 2^61 (2,305,843,009,213,693,952) and 2^62 (4,611,686,018,427,387,904)

Divisibility tests

Divisible by 2Yes

Divisible by 3No, remainder 2

Divisible by 4No, remainder 2

Divisible by 5No, remainder 2

Divisible by 6No, remainder 2

Divisible by 7No, remainder 3

Divisible by 8No, remainder 2

Divisible by 9No, remainder 2

Divisible by 10No, remainder 2

Divisible by 11No, remainder 2

Divisible by 12No, remainder 2

Divisible by 100No, remainder 2

Collatz (3n + 1) trajectory

Steps to reach 1385the total stopping time

Highest value reached5,200,369,827,840,000,0041× the starting value

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

First steps3,466,913,218,560,000,002 → 1,733,456,609,280,000,001 → 5,200,369,827,840,000,004 → 2,600,184,913,920,000,002 → 1,300,092,456,960,000,001 → 3,900,277,370,880,000,004 → 1,950,138,685,440,000,002 → 975,069,342,720,000,001 → 2,925,208,028,160,000,004 → 1,462,604,014,080,000,002 → …

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

Keep nerding

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