Recognised as Number
375,766,548,004
- Positive
- Even
- Composite
- Perfect square
- 12 digits
375,766,548,004 is an even 12-digit integer and a composite number. It has 27 divisors and a digital root of 1.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value375,766,548,004
Digit count12
Digit sum55
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, 612,998²
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2^2 × 53^2 × 5,783^2
Distinct prime factors32, 53, 5,783
Number of divisors27
Sum of divisors σ(n)670,348,863,793
Aliquot sum294,582,315,789sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)184,306,430,672integers below n that share no factor with it
Carmichael function λ(n)46,076,607,668the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 184,306,430,672
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 53, 106, 212, 2,809, 5,618, 5,783, 11,236, 11,566, 23,132, 306,499, 612,998, 1,225,996, 16,244,447, 32,488,894, 33,443,089, 64,977,788, 66,886,178, 133,772,356, 1,772,483,717, 3,544,967,434, 7,089,934,868, 93,941,637,001, 187,883,274,002, 375,766,548,00427 in total
Arithmetic
Previous number375,766,548,003
Next number375,766,548,005
Double751,533,096,008
Half187,883,274,002
Square141,200,498,598,842,436,384,016
Cube53,058,423,934,930,661,110,326,664,442,304,064
Square root612,998exact
Cube root7,216.158078586≈
Negation-375,766,548,004
Reciprocal2.66122678 × 10^-12≈
Representations
Decimal375,766,548,004
Binary10101110111110101101110011111100010010039 bits
Octal5357533477044
Hexadecimal577D6E7E24
Base 364SMHP82S
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree hundred and seventy-five billion, seven hundred and sixty-six million, five hundred and forty-eight thousand and four
Ordinalthree hundred and seventy-five billion, seven hundred and sixty-six million, five hundred and forty-eight thousand and fourth
Scientific notation3.75766548 × 10^11
Engineering notation375.766548 × 10^9
In other bases
Ternary1022220220211001110100201base 3; the most digit-efficient integer base after e: 25 digits
Quinary22124032214014004base 5; one hand: 17 digits
Septenary36101562646321base 7: 14 digits
Nonary1286824043321base 9; each digit is two ternary digits: 13 digits
Duodecimal609ab559084base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 11 digits
Vigesimaledb70ia04base 20; hands and feet, and the Mayan and Yoruba systems: 9 digits
Sexagesimal8:3:14:19:56:40:4base 60; Babylonian, and still how an hour and a circle are divided: 7 digits
Balanced ternary11000T10T1T11001110101T01digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11010100010000010101100111000001001100100base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
0000000000000000000000000101011101111101011011100111111000100100
Bit length39 bitsto write the magnitude
Set bits24the population count, or Hamming weight
Zero bits15within that length
Bit parityeven24 set bits, so even; not the same as the number itself being even
Highest set bitbit 38worth 274,877,906,944
Lowest set bitbit 22 trailing zeros
Power of twoNo
Bytes557 7d 6e 7e 24
Gray code111110011000011110110010100000100110110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
64-bit0000000000000000000000000101011101111101011011100111111000100100
One's complement1111111111111111111111111010100010000010100100011000000111011011at 64 bits, every bit flipped
Bits reversed0010010001111110011101101011111011101010000000000000000000000000at 64 bits
Rotated left by 10000000000000000000000001010111011111010110111001111110001001000at 64 bits, wrapping
Shifted left by 11010111011111010110111001111110001001000= 751,533,096,008, no wrap
Shifted right by 110101110111110101101110011111100010010= 187,883,274,002, discarding the low bit
These bits as a double1.85653342 × 10^-312≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
375,766,548,004 to the power 2141,200,498,598,842,436,384,016
375,766,548,004 to the power 353,058,423,934,930,661,110,326,664,442,304,064
375,766,548,004 to the power 4199375808045617048405250204942… (47 digits)
375,766,548,004 to the power 5749187591448096480413722427812… (58 digits)
First ten multiples375,766,548,004, 751,533,096,008, 1,127,299,644,012, 1,503,066,192,016, 1,878,832,740,020, 2,254,599,288,024, 2,630,365,836,028, 3,006,132,384,032, 3,381,898,932,036, 3,757,665,480,040
Powers of twoBetween 2^38 (274,877,906,944) and 2^39 (549,755,813,888)
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 1
Divisible by 12No, remainder 4
Divisible by 100No, remainder 4
Collatz (3n + 1) trajectory
Steps to reach 1168the total stopping time
Highest value reached3,428,039,074,6969× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps375,766,548,004 → 187,883,274,002 → 93,941,637,001 → 281,824,911,004 → 140,912,455,502 → 70,456,227,751 → 211,368,683,254 → 105,684,341,627 → 317,053,024,882 → 158,526,512,441 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage37,576,654,800,400%
375,766,548,004% as a decimal3,757,665,480.04
375,766,548,004% of 100375,766,548,004
375,766,548,004% of 1,0003,757,665,480,040
As a fraction of 100375,766,548,004/100
Read another way
As seconds11,907 years, 118 days and 2 hours
As bytes349.96 GiB
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Neighbouring numbers
Derived from 375,766,548,004
Nearby primes
Also reads as
375766548004 (identifier)
- 12 characters
- Checksum fails
375766548004 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