Recognised as Number
309,059,276,761
- Positive
- Odd
- Composite
- Perfect square
- 12 digits
309,059,276,761 is an odd 12-digit integer and a composite number. It has 3 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value309,059,276,761
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, 555,931²
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation555,931^2
Distinct prime factors1555,931
Number of divisors3
Sum of divisors σ(n)309,059,832,693
Aliquot sum555,932sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)309,058,720,830integers below n that share no factor with it
Carmichael function λ(n)309,058,720,830the 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, 555,931, 309,059,276,7613 in total
Arithmetic
Previous number309,059,276,760
Next number309,059,276,762
Double618,118,553,522
Square95,517,636,552,032,394,651,121
Cube29,520,611,670,691,189,635,518,381,177,899,081
Square root555,931exact
Cube root6,761.046579737≈
Negation-309,059,276,761
Reciprocal3.23562525 × 10^-12≈
Representations
Decimal309,059,276,761
Binary10001111111010101011110010011111101100139 bits
Octal4376527447731
Hexadecimal47F55E4FD9
Base 363XZ9WW61
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree hundred and nine billion, fifty-nine million, two hundred and seventy-six thousand, seven hundred and sixty-one
Ordinalthree hundred and nine billion, fifty-nine million, two hundred and seventy-six thousand, seven hundred and sixty-first
Scientific notation3.09059277 × 10^11
Engineering notation309.059277 × 10^9
In other bases
Ternary1002112201212112222012001base 3; the most digit-efficient integer base after e: 25 digits
Quinary20030423133324021base 5; one hand: 17 digits
Septenary31220530336054base 7: 14 digits
Nonary1075655488161base 9; each digit is two ternary digits: 13 digits
Duodecimal4ba933b0161base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 11 digits
Vigesimalc19109bi1base 20; hands and feet, and the Mayan and Yoruba systems: 9 digits
Sexagesimal6:37:27:9:59:6:1base 60; Babylonian, and still how an hour and a circle are divided: 7 digits
Balanced ternary1010TT0T1T0T0TT000T1TT001digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101100000001010101000100101000000101001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
0000000000000000000000000100011111110101010111100100111111011001
Bit length39 bitsto write the magnitude
Set bits25the population count, or Hamming weight
Zero bits14within that length
Bit parityodd25 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 38worth 274,877,906,944
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes547 f5 5e 4f d9
Gray code110010000001111111100010110100000110101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
64-bit0000000000000000000000000100011111110101010111100100111111011001
One's complement1111111111111111111111111011100000001010101000011011000000100110at 64 bits, every bit flipped
Bits reversed1001101111110010011110101010111111100010000000000000000000000000at 64 bits
Rotated left by 10000000000000000000000001000111111101010101111001001111110110010at 64 bits, wrapping
Shifted left by 11000111111101010101111001001111110110010= 618,118,553,522, no wrap
Shifted right by 110001111111010101011110010011111101100= 154,529,638,380, discarding the low bit
These bits as a double1.52695571 × 10^-312≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
309,059,276,761 to the power 295,517,636,552,032,394,651,121
309,059,276,761 to the power 329,520,611,670,691,189,635,518,381,177,899,081
309,059,276,761 to the power 4912361889248615496972801008416… (46 digits)
309,059,276,761 to the power 5281973905635476687214990464549… (58 digits)
First ten multiples309,059,276,761, 618,118,553,522, 927,177,830,283, 1,236,237,107,044, 1,545,296,383,805, 1,854,355,660,566, 2,163,414,937,327, 2,472,474,214,088, 2,781,533,490,849, 3,090,592,767,610
Powers of twoBetween 2^38 (274,877,906,944) and 2^39 (549,755,813,888)
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 1
Divisible by 10No, remainder 1
Divisible by 11No, remainder 4
Divisible by 12No, remainder 1
Divisible by 100No, remainder 61
Collatz (3n + 1) trajectory
Steps to reach 1253the total stopping time
Highest value reached1,043,075,059,0723× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps309,059,276,761 → 927,177,830,284 → 463,588,915,142 → 231,794,457,571 → 695,383,372,714 → 347,691,686,357 → 1,043,075,059,072 → 521,537,529,536 → 260,768,764,768 → 130,384,382,384 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage30,905,927,676,100%
309,059,276,761% as a decimal3,090,592,767.61
309,059,276,761% of 100309,059,276,761
309,059,276,761% of 1,0003,090,592,767,610
As a fraction of 100309,059,276,761/100
Read another way
As seconds9,793 years, 181 days and 17 hours
As bytes287.834 GiB
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Neighbouring numbers
Derived from 309,059,276,761
Nearby primes
Also reads as
309059276761 (identifier)
- 12 characters
- Checksum valid
309059276761 matches the shape of Luhn (cards, IMEI), GTIN-12 (UPC-A). The check digit is valid for Luhn (cards, IMEI). 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 validmod 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