Nerdulator> put something in

Recognised as Number

3,760,000,000,000,000,000

  • Positive
  • Even
  • Composite
  • 19 digits

3,760,000,000,000,000,000 is an even 19-digit integer and a composite number. It has 680 divisors and a digital root of 7.

Number properties

ParityEvendivisible by 2
SignPositive
PrimalityComposite
Digit count19
Digit sum16
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberYesdivisible by its own digit sum

Factors & divisors

Prime factorisation2^19 × 5^16 × 47
Distinct prime factors32, 5, 47
Number of divisors680
Sum of divisors σ(n)9,599,990,844,713,979,600
Aliquot sum5,839,990,844,713,979,600sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)1,472,000,000,000,000,000integers below n that share no factor with it
Carmichael function λ(n)92,000,000,000,000,000the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,472,000,000,000,000,000
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors680 divisors, too many to listlisting is capped at 512

Arithmetic

Square14,137,600,000,000,000,000,000,000,000,000,000,000
Cube53,157,376,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000
Square root1,939,071,942≈irrational, shown to 9 decimal places
Cube root1,554,996≈

Representations

Decimal3,760,000,000,000,000,000
Binary1101000010111000110100000101000010001101111000000000000000000062 bits
Octal320561501204336000000
Hexadecimal342E341423780000
Base 36SKEGRE2KVMKG
In wordsthree quintillion, seven hundred and sixty quadrillion
Ordinalthree quintillion, seven hundred and sixty quadrillionth
Engineering notation3.76 × 10^18

In other bases

Ternary221001101002010011111211201112122010021base 3; the most digit-efficient integer base after e: 39 digits
Quinary223020121210000000000000000base 5; one hand: 27 digits
Septenary6505665345304363652326base 7: 22 digits
Nonary27041063144751478107base 9; each digit is two ternary digits: 20 digits
Duodecimal184065031bba2b1b14base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 18 digits
Vigesimal25hj7a000000000base 20; hands and feet, and the Mayan and Yoruba systems: 15 digits
Sexagesimal6:13:6:4:9:6:30:7:24:26:40base 60; Babylonian, and still how an hour and a circle are divided: 11 digits
Balanced ternary10T100110101T0101TTTTT0TTT1TTT0T0T0101T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary111010001110010011101000001010001100100100010000000000000000000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

0011010000101110001101000001010000100011011110000000000000000000
Bit length62 bitsto write the magnitude
Set bits19the population count, or Hamming weight
Zero bits43within that length
Bit parityodd19 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 1919 trailing zeros
Power of twoNo
Bytes834 2e 34 14 23 78 00 00
Gray code10111000111001001011100001111000110010110001000000000000000000n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

64-bit0011010000101110001101000001010000100011011110000000000000000000
One's complement1100101111010001110010111110101111011100100001111111111111111111at 64 bits, every bit flipped
Bits reversed0000000000000000000111101100010000101000001011000111010000101100at 64 bits
Rotated left by 10110100001011100011010000010100001000110111100000000000000000000at 64 bits, wrapping
Shifted left by 1110100001011100011010000010100001000110111100000000000000000000= 7,520,000,000,000,000,000, no wrap
Shifted right by 11101000010111000110100000101000010001101111000000000000000000= 1,880,000,000,000,000,000, discarding the low bit
These bits as a double2.40584218 × 10^-57≈IEEE-754 binary64 reinterpretation of the same 64 bits (normal)

Nearest landmarks

Previous prime3,759,999,999,999,999,983−17
Distance to nearest prime17
Nearest square below3,759,999,996,251,651,364
Nearest square above3,760,000,000,129,795,249

Powers & multiples

3,760,000,000,000,000,000 to the power 214,137,600,000,000,000,000,000,000,000,000,000,000
3,760,000,000,000,000,000 to the power 3531573760000000000000000000000… (56 digits)
3,760,000,000,000,000,000 to the power 4199871733760000000000000000000… (75 digits)
3,760,000,000,000,000,000 to the power 5751517718937600000000000000000… (93 digits)
First ten multiples3,760,000,000,000,000,000, 7,520,000,000,000,000,000, 11,280,000,000,000,000,000, 15,040,000,000,000,000,000, 18,800,000,000,000,000,000, 22,560,000,000,000,000,000, 26,320,000,000,000,000,000, 30,080,000,000,000,000,000, 33,840,000,000,000,000,000, 37,600,000,000,000,000,000
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 5Yes
Divisible by 6No, remainder 4
Divisible by 7No, remainder 6
Divisible by 8Yes
Divisible by 9No, remainder 7
Divisible by 10Yes
Divisible by 11No, remainder 2
Divisible by 12No, remainder 4
Divisible by 100Yes

Collatz (3n + 1) trajectory

Steps to reach 1305the total stopping time
Highest value reached3,760,000,000,000,000,000
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,760,000,000,000,000,000 → 1,880,000,000,000,000,000 → 940,000,000,000,000,000 → 470,000,000,000,000,000 → 235,000,000,000,000,000 → 117,500,000,000,000,000 → 58,750,000,000,000,000 → 29,375,000,000,000,000 → 14,687,500,000,000,000 → 7,343,750,000,000,000 → …
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.

Nerdulate something else

Nothing in mind? Surprise me · today’s page

Every value on this page was computed from “3760000000000000000” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.