Recognised as Number
637,907,313,481
- Positive
- Odd
- Composite
- Perfect square
- 12 digits
637,907,313,481 is an odd 12-digit integer and a composite number. It has 3 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value637,907,313,481
Digit count12
Digit sum52
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
Perfect squareYes, 798,691²
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation798,691^2
Distinct prime factors1798,691
Number of divisors3
Sum of divisors σ(n)637,908,112,173
Aliquot sum798,692sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)637,906,514,790integers below n that share no factor with it
Carmichael function λ(n)637,906,514,790the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 798,691, 637,907,313,4813 in total
Arithmetic
Previous number637,907,313,480
Next number637,907,313,482
Double1,275,814,626,962
Square406,925,740,592,546,804,337,361
Cube259,580,905,967,657,841,006,597,713,907,263,641
Square root798,691exact
Cube root8,608.335677965≈
Negation-637,907,313,481
Reciprocal1.56762586 × 10^-12≈
Representations
Decimal637,907,313,481
Binary100101001000011000111101001000110100100140 bits
Octal11220617221511
Hexadecimal94863D2349
Base 36851TJL8P
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordssix hundred and thirty-seven billion, nine hundred and seven million, three hundred and thirteen thousand, four hundred and eighty-one
Ordinalsix hundred and thirty-seven billion, nine hundred and seven million, three hundred and thirteen thousand, four hundred and eighty-first
Scientific notation6.37907313 × 10^11
Engineering notation637.907313 × 10^9
In other bases
Ternary2020222112212011002202121base 3; the most digit-efficient integer base after e: 25 digits
Quinary40422413233012411base 5; one hand: 17 digits
Septenary64041636461644base 7: 14 digits
Nonary2228485132677base 9; each digit is two ternary digits: 13 digits
Duodecimala3769a50b21base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 11 digits
Vigesimal14i760e3e1base 20; hands and feet, and the Mayan and Yoruba systems: 10 digits
Sexagesimal13:40:21:14:35:58:1base 60; Babylonian, and still how an hour and a circle are divided: 7 digits
Balanced ternary1T1T1000TT00TT011010T10TT1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11001010110011010010011010110011101011001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
0000000000000000000000001001010010000110001111010010001101001001
Bit length40 bitsto write the magnitude
Set bits17the population count, or Hamming weight
Zero bits23within that length
Bit parityodd17 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 39worth 549,755,813,888
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes594 86 3d 23 49
Gray code1101111011000101001000111011001011101101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
64-bit0000000000000000000000001001010010000110001111010010001101001001
One's complement1111111111111111111111110110101101111001110000101101110010110110at 64 bits, every bit flipped
Bits reversed1001001011000100101111000110000100101001000000000000000000000000at 64 bits
Rotated left by 10000000000000000000000010010100100001100011110100100011010010010at 64 bits, wrapping
Shifted left by 110010100100001100011110100100011010010010= 1,275,814,626,962, no wrap
Shifted right by 1100101001000011000111101001000110100100= 318,953,656,740, discarding the low bit
These bits as a double3.15168089 × 10^-312≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
637,907,313,481 to the power 2406,925,740,592,546,804,337,361
637,907,313,481 to the power 3259,580,905,967,657,841,006,597,713,907,263,641
637,907,313,481 to the power 4165588558356792694030343384474… (48 digits)
637,907,313,481 to the power 5105630152404573419316544774686… (60 digits)
First ten multiples637,907,313,481, 1,275,814,626,962, 1,913,721,940,443, 2,551,629,253,924, 3,189,536,567,405, 3,827,443,880,886, 4,465,351,194,367, 5,103,258,507,848, 5,741,165,821,329, 6,379,073,134,810
Powers of twoBetween 2^39 (549,755,813,888) and 2^40 (1,099,511,627,776)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 1
Divisible by 7No, remainder 4
Divisible by 8No, remainder 1
Divisible by 9No, remainder 7
Divisible by 10No, remainder 1
Divisible by 11No, remainder 9
Divisible by 12No, remainder 1
Divisible by 100No, remainder 81
Collatz (3n + 1) trajectory
Steps to reach 1360the total stopping time
Highest value reached3,229,405,774,5045× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps637,907,313,481 → 1,913,721,940,444 → 956,860,970,222 → 478,430,485,111 → 1,435,291,455,334 → 717,645,727,667 → 2,152,937,183,002 → 1,076,468,591,501 → 3,229,405,774,504 → 1,614,702,887,252 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage63,790,731,348,100%
637,907,313,481% as a decimal6,379,073,134.81
637,907,313,481% of 100637,907,313,481
637,907,313,481% of 1,0006,379,073,134,810
As a fraction of 100637,907,313,481/100
Read another way
As seconds20,214 years, 22 days and 23 hours
As bytes594.097 GiB
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Neighbouring numbers
Derived from 637,907,313,481
Nearby primes
Also reads as
637907313481 (identifier)
- 12 characters
- Checksum fails
637907313481 matches the shape of Luhn (cards, IMEI), GTIN-12 (UPC-A). No check digit validates. A valid check digit only means the number is well-formed; it cannot tell you the thing it identifies exists.
Checksum tests
Luhn (cards, IMEI)Check digit does not matchmod 10 with every second digit doubled
GTIN-12 (UPC-A)Check digit does not matchGS1 mod 10, weights 3 and 1 alternating from the right
What this does not tell you
ExistenceNot checkedno network lookup is made, ever
Ownership or validity in useNot checked
Nerdulate something else
Nothing in mind? Surprise me · today’s page