Recognised as Number
3,610,000,000,000,000,000
- Positive
- Even
- Composite
- Perfect square
- 19 digits
3,610,000,000,000,000,000 is an even 19-digit integer and a composite number. It has 867 divisors and a digital root of 1.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value3,610,000,000,000,000,000
Digit count19
Digit sum10
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,900,000,000²
Happy numberNosquared-digit sums reach 1
Harshad numberYesdivisible by its own digit sum
Factors & divisors
Prime factorisation2^16 × 5^16 × 19^2
Distinct prime factors32, 5, 19
Number of divisors867
Sum of divisors σ(n)9,524,927,330,004,605,331
Aliquot sum5,914,927,330,004,605,331sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)1,368,000,000,000,000,000integers below n that share no factor with it
Carmichael function λ(n)85,500,000,000,000,000the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,368,000,000,000,000,000
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors867 divisors, too many to listlisting is capped at 512
Arithmetic
Previous number3,609,999,999,999,999,999
Next number3,610,000,000,000,000,001
Square13,032,100,000,000,000,000,000,000,000,000,000,000
Cube47,045,881,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000
Square root1,900,000,000exact
Cube root1,534,036≈
Negation-3,610,000,000,000,000,000
Representations
Decimal3,610,000,000,000,000,000
Binary1100100001100101001011110111111001011100101001000000000000000062 bits
Octal310312275762712200000
Hexadecimal32194BDF97290000
Base 36RFDI75DE3XTS
In wordsthree quintillion, six hundred and ten quadrillion
Ordinalthree quintillion, six hundred and ten quadrillionth
Engineering notation3.61 × 10^18
In other bases
Ternary220001101112112020120002021201000010201base 3; the most digit-efficient integer base after e: 39 digits
Quinary220240324410000000000000000base 5; one hand: 27 digits
Septenary6314611234033121565502base 7: 22 digits
Nonary26041475216067630121base 9; each digit is two ternary digits: 20 digits
Duodecimal1763856350b422a454base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 18 digits
Vigesimal2416j1500000000base 20; hands and feet, and the Mayan and Yoruba systems: 15 digits
Sexagesimal5:58:13:0:28:31:56:2:57:46:40base 60; Babylonian, and still how an hour and a circle are divided: 11 digits
Balanced ternary10T000111TTT0TTT1T1TT001T10TT01000011T01digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary111011001101001010111000010000011101011011110010000000000000000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
0011001000011001010010111101111110010111001010010000000000000000
Bit length62 bitsto write the magnitude
Set bits25the population count, or Hamming weight
Zero bits37within that length
Bit parityodd25 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 1616 trailing zeros
Power of twoNo
Bytes832 19 4b df 97 29 00 00
Gray code10101100010101111011100011000001011100101111011000000000000000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
64-bit0011001000011001010010111101111110010111001010010000000000000000
One's complement1100110111100110101101000010000001101000110101101111111111111111at 64 bits, every bit flipped
Bits reversed0000000000000000100101001110100111111011110100101001100001001100at 64 bits
Rotated left by 10110010000110010100101111011111100101110010100100000000000000000at 64 bits, wrapping
Shifted left by 1110010000110010100101111011111100101110010100100000000000000000= 7,220,000,000,000,000,000, no wrap
Shifted right by 11100100001100101001011110111111001011100101001000000000000000= 1,805,000,000,000,000,000, discarding the low bit
These bits as a double2.34573725 × 10^-67≈IEEE-754 binary64 reinterpretation of the same 64 bits (normal)
Nearest landmarks
Distance to nearest prime33
Nearest square below3,610,000,000,000,000,000
Nearest square above3,610,000,003,800,000,001
Powers & multiples
3,610,000,000,000,000,000 to the power 213,032,100,000,000,000,000,000,000,000,000,000,000
3,610,000,000,000,000,000 to the power 3470458810000000000000000000000… (56 digits)
3,610,000,000,000,000,000 to the power 4169835630410000000000000000000… (75 digits)
3,610,000,000,000,000,000 to the power 5613106625780100000000000000000… (93 digits)
First ten multiples3,610,000,000,000,000,000, 7,220,000,000,000,000,000, 10,830,000,000,000,000,000, 14,440,000,000,000,000,000, 18,050,000,000,000,000,000, 21,660,000,000,000,000,000, 25,270,000,000,000,000,000, 28,880,000,000,000,000,000, 32,490,000,000,000,000,000, 36,100,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 2
Divisible by 8Yes
Divisible by 9No, remainder 1
Divisible by 10Yes
Divisible by 11No, remainder 9
Divisible by 12No, remainder 4
Divisible by 100Yes
Collatz (3n + 1) trajectory
Steps to reach 1491the total stopping time
Highest value reached3,610,000,000,000,000,000
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,610,000,000,000,000,000 → 1,805,000,000,000,000,000 → 902,500,000,000,000,000 → 451,250,000,000,000,000 → 225,625,000,000,000,000 → 112,812,500,000,000,000 → 56,406,250,000,000,000 → 28,203,125,000,000,000 → 14,101,562,500,000,000 → 7,050,781,250,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.
Neighbouring numbers
Derived from 3,610,000,000,000,000,000
Nearby primes
Nerdulate something else
Nothing in mind? Surprise me · today’s page