Recognised as Number

3,466,913,221,801,273,924

Positive
Even
Composite
Perfect square
19 digits

3,466,913,221,801,273,924 is an even 19-digit integer and a composite number. It has 27 divisors and a digital root of 1.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value3,466,913,221,801,273,924

Digit count19

Digit sum73

Digit product0zero, because one of the digits is zero

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

Digital root1repeated digit sum

PalindromicNoreads differently backwards

Perfect squareYes, 1,861,964,882²

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2^2 × 17^2 × 54,763,673^2

Distinct prime factors32, 17, 54,763,673

Number of divisors27

Sum of divisors σ(n)6,444,979,800,776,181,847

Aliquot sum2,978,066,578,974,907,923sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)1,631,488,545,173,867,264integers below n that share no factor with it

Carmichael function λ(n)101,968,034,073,366,704the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,631,488,545,173,867,264

Möbius function μ(n)0zero, because a prime divides n twice

SquarefreeNohas a repeated prime factor

All divisors1, 2, 4, 17, 34, 68, 289, 578, 1,156, 54,763,673, 109,527,346, 219,054,692, 930,982,441, 1,861,964,882, 3,723,929,764, 15,826,701,497, 31,653,402,994, 63,306,805,988, 2,999,059,880,450,929, 5,998,119,760,901,858, 11,996,239,521,803,716, 50,984,017,967,665,793, 101,968,035,935,331,586, 203,936,071,870,663,172, 866,728,305,450,318,481, 1,733,456,610,900,636,962, 3,466,913,221,801,273,92427 in total

Arithmetic

Previous number3,466,913,221,801,273,923

Next number3,466,913,221,801,273,925

Double6,933,826,443,602,547,848

Square12,019,487,287,500,489,163,158,338,309,282,357,776

Cube41,670,519,396,307,775,667,044,502,304,525,151,166,064,756,935,147,433,024

Square root1,861,964,882exact

Cube root1,513,494≈

Negation-3,466,913,221,801,273,924

Representations

Decimal3,466,913,221,801,273,924

Binary1100000001110011110011001101001110110010010001111010100100010062 bits

Octal300347463235444365104

Hexadecimal301CF334EC91EA44

Base 36QC8M62X9PYYS

In wordsthree quintillion, four hundred and sixty-six quadrillion, nine hundred and thirteen trillion, two hundred and twenty-one billion, eight hundred and one million, two hundred and seventy-three thousand, nine hundred and twenty-four

Ordinalthree quintillion, four hundred and sixty-six quadrillion, nine hundred and thirteen trillion, two hundred and twenty-one billion, eight hundred and one million, two hundred and seventy-three thousand, nine hundred and twenty-fourth

Engineering notation3.466913 × 10^18

In other bases

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

Quinary213040310222211222111231144base 5; one hand: 27 digits

Septenary6131004232330466131441base 7: 22 digits

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

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

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

Sexagesimal5:44:1:6:22:17:30:5:53:52:4base 60; Babylonian, and still how an hour and a circle are divided: 11 digits

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

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

Bit-level

0011000000011100111100110011010011101100100100011110101001000100

Bit length62 bitsto write the magnitude

Set bits29the population count, or Hamming weight

Zero bits33within that length

Bit parityodd29 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 22 trailing zeros

Power of twoNo

Bytes830 1c f3 34 ec 91 ea 44

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

At each machine width

64-bit0011000000011100111100110011010011101100100100011110101001000100

One's complement1100111111100011000011001100101100010011011011100001010110111011at 64 bits, every bit flipped

Bits reversed0010001001010111100010010011011100101100110011110011100000001100at 64 bits

Rotated left by 10110000000111001111001100110100111011001001000111101010010001000at 64 bits, wrapping

Shifted left by 1110000000111001111001100110100111011001001000111101010010001000= 6,933,826,443,602,547,848, no wrap

Shifted right by 11100000001110011110011001101001110110010010001111010100100010= 1,733,456,610,900,636,962, discarding the low bit

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

Nearest landmarks

Next prime3,466,913,221,801,273,927+3

Previous prime3,466,913,221,801,273,903−21

Distance to nearest prime3

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

Nearest square above3,466,913,225,525,203,689

Powers & multiples

3,466,913,221,801,273,924 to the power 212,019,487,287,500,489,163,158,338,309,282,357,776

3,466,913,221,801,273,924 to the power 3416705193963077756670445023045… (56 digits)

3,466,913,221,801,273,924 to the power 4144468074654385866636976321555… (75 digits)

3,466,913,221,801,273,924 to the power 5500858278147463867750320723834… (93 digits)

First ten multiples3,466,913,221,801,273,924, 6,933,826,443,602,547,848, 10,400,739,665,403,821,772, 13,867,652,887,205,095,696, 17,334,566,109,006,369,620, 20,801,479,330,807,643,544, 24,268,392,552,608,917,468, 27,735,305,774,410,191,392, 31,202,218,996,211,465,316, 34,669,132,218,012,739,240

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 1

Divisible by 4Yes

Divisible by 5No, remainder 4

Divisible by 6No, remainder 4

Divisible by 7No, remainder 1

Divisible by 8No, remainder 4

Divisible by 9No, remainder 1

Divisible by 10No, remainder 4

Divisible by 11No, remainder 9

Divisible by 12No, remainder 4

Divisible by 100No, remainder 24

Collatz (3n + 1) trajectory

Steps to reach 1328the total stopping time

Highest value reached3,466,913,221,801,273,924

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

First steps3,466,913,221,801,273,924 → 1,733,456,610,900,636,962 → 866,728,305,450,318,481 → 2,600,184,916,350,955,444 → 1,300,092,458,175,477,722 → 650,046,229,087,738,861 → 1,950,138,687,263,216,584 → 975,069,343,631,608,292 → 487,534,671,815,804,146 → 243,767,335,907,902,073 → …

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.