Recognised as Number
-1,067,462,649
- Negative
- Odd
- 10 digits
-1,067,462,649 is an odd 10-digit integer and the negative of 1,067,462,649. It has 24 divisors and a digital root of 9.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value1,067,462,649
Digit count10
Digit sum45
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 3^2 × 11 × 31 × 347,821
Distinct prime factors43, 11, 31, 347,821
Number of divisors24
Sum of divisors σ(n)1,736,327,424
SquarefreeNohas a repeated prime factor
All divisors1, 3, 9, 11, 31, 33, 93, 99, 279, 341, 1,023, 3,069, 347,821, 1,043,463, 3,130,389, 3,826,031, 10,782,451, 11,478,093, 32,347,353, 34,434,279, 97,042,059, 118,606,961, 355,820,883, 1,067,462,64924 in total
Arithmetic
Previous number-1,067,462,650
Next number-1,067,462,648
Double-2,134,925,298
Half-533,731,324.5
Square1,139,476,507,010,097,201
Cube-1,216,348,610,646,265,427,926,945,449
Cube root-1,022.000000319≈
Negation1,067,462,649
Reciprocal-9.36800928 × 10^-10≈
Representations
Decimal-1,067,462,649
Binary11111110100000001011111111100130 bits
Octal7750027771
Hexadecimal3FA02FF9
Base 36HNJFG9
In wordsminus one billion, sixty-seven million, four hundred and sixty-two thousand, six hundred and forty-nine
Ordinalminus one billion, sixty-seven million, four hundred and sixty-two thousand, six hundred and forty-ninth
Scientific notation-1.06746265 × 10^9
Engineering notation-1.067463 × 10^9
In other bases
Ternary2202101121201110200base 3; the most digit-efficient integer base after e: 19 digits
Quinary4141232301044base 5; one hand: 13 digits
Septenary35311166001base 7: 11 digits
Nonary2671551420base 9; each digit is two ternary digits: 10 digits
Duodecimal2595a8709base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 9 digits
Vigesimalgdbcgc9base 20; hands and feet, and the Mayan and Yoruba systems: 7 digits
Sexagesimal1:22:21:57:24:9base 60; Babylonian, and still how an hour and a circle are divided: 6 digits
Balanced ternaryT01T1TT110110TTTT100digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11000001101000001101000000011011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11000000010111111101000000000111
Bit length30 bitsto write the magnitude
Set bits19the population count, or Hamming weight
Zero bits11within that length
Bit parityodd19 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 29worth 536,870,912
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes43f a0 2f f9
Gray code100000011100000011100000000101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11000000010111111101000000000111two's complement
64-bit1111111111111111111111111111111111000000010111111101000000000111two's complement
One's complement00111111101000000010111111111000at 32 bits, every bit flipped
Bits reversed11100000000010111111101000000011at 32 bits
Rotated left by 110000000101111111010000000001111at 32 bits, wrapping
Shifted left by 1-1111111010000000101111111110010= -2,134,925,298, no wrap
Shifted right by 1-11111110100000001011111111101= -533,731,324, discarding the low bit
These bits as a double5.27396623 × 10^-315≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
-1,067,462,649 to the power 21,139,476,507,010,097,201
-1,067,462,649 to the power 3-1,216,348,610,646,265,427,926,945,449
-1,067,462,649 to the power 41,298,406,710,027,932,095,652,015,767,468,034,401
-1,067,462,649 to the power 5-13860006661657912588168221333… (47 digits)
First ten multiples-1,067,462,649, -2,134,925,298, -3,202,387,947, -4,269,850,596, -5,337,313,245, -6,404,775,894, -7,472,238,543, -8,539,701,192, -9,607,163,841, -10,674,626,490
Powers of twoBetween 2^29 (536,870,912) and 2^30 (1,073,741,824)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 1
Divisible by 5No, remainder 4
Divisible by 6No, remainder 3
Divisible by 7No, remainder 1
Divisible by 8No, remainder 1
Divisible by 9Yes
Divisible by 10No, remainder 9
Divisible by 11Yes
Divisible by 12No, remainder 9
Divisible by 100No, remainder 49
As a percentage & fraction
As a percentage-106,746,264,900%
-1,067,462,649% as a decimal-10,674,626.49
-1,067,462,649% of 100-1,067,462,649
-1,067,462,649% of 1,000-10,674,626,490
As a fraction of 100-1,067,462,649/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Neighbouring numbers
Derived from -1,067,462,649
Also reads as
1067462649 (identifier)
- 10 characters
- Checksum fails
1067462649 matches the shape of ISBN-10, Luhn (cards, IMEI). 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
ISBN-10Check digit does not matchmod 11 with weights 10 down to 1
Luhn (cards, IMEI)Check digit does not matchmod 10 with every second digit doubled
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