Recognised as Number
-1,664,150,401
- Negative
- Odd
- 10 digits
-1,664,150,401 is an odd 10-digit integer and the negative of 1,664,150,401. It has 16 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value1,664,150,401
Digit count10
Digit sum28
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
Factors & divisors
Prime factorisation−1 × 31 × 59 × 401 × 2,269
Distinct prime factors431, 59, 401, 2,269
Number of divisors16
Sum of divisors σ(n)1,752,076,800
SquarefreeYesno repeated prime factor
All divisors1, 31, 59, 401, 1,829, 2,269, 12,431, 23,659, 70,339, 133,871, 733,429, 909,869, 4,150,001, 28,205,939, 53,682,271, 1,664,150,40116 in total
Arithmetic
Previous number-1,664,150,402
Next number-1,664,150,400
Double-3,328,300,802
Half-832,075,200.5
Square2,769,396,557,148,460,801
Cube-4,608,692,391,106,630,458,516,931,201
Cube root-1,185.0341284≈
Negation1,664,150,401
Reciprocal-6.00907225 × 10^-10≈
Representations
Decimal-1,664,150,401
Binary110001100110000111010111000000131 bits
Octal14314165601
Hexadecimal6330EB81
Base 36RISIO1
In wordsminus one billion, six hundred and sixty-four million, one hundred and fifty thousand, four hundred and one
Ordinalminus one billion, six hundred and sixty-four million, one hundred and fifty thousand, four hundred and first
Scientific notation-1.6641504 × 10^9
Engineering notation-1.66415 × 10^9
In other bases
Ternary11021222101121012001base 3; the most digit-efficient integer base after e: 20 digits
Quinary11402010303101base 5; one hand: 14 digits
Septenary56145021304base 7: 11 digits
Nonary4258347161base 9; each digit is two ternary digits: 10 digits
Duodecimal3a53a2001base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 9 digits
Vigesimal1600ig01base 20; hands and feet, and the Mayan and Yoruba systems: 8 digits
Sexagesimal2:8:24:24:0:1base 60; Babylonian, and still how an hour and a circle are divided: 6 digits
Balanced ternaryTTT01001TT111TT1100Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101101110100110001010110000011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
10011100110011110001010001111111
Bit length31 bitsto write the magnitude
Set bits14the population count, or Hamming weight
Zero bits17within that length
Bit parityeven14 set bits, so even; not the same as the number itself being odd
Highest set bitbit 30worth 1,073,741,824
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes463 30 eb 81
Gray code1010010101010001001111001000001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit10011100110011110001010001111111two's complement
64-bit1111111111111111111111111111111110011100110011110001010001111111two's complement
One's complement01100011001100001110101110000000at 32 bits, every bit flipped
Bits reversed11111110001010001111001100111001at 32 bits
Rotated left by 100111001100111100010100011111111at 32 bits, wrapping
Shifted left by 1-11000110011000011101011100000010= -3,328,300,802, no wrap
Shifted right by 1-110001100110000111010111000001= -832,075,200, discarding the low bit
These bits as a double8.22199543 × 10^-315≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
-1,664,150,401 to the power 22,769,396,557,148,460,801
-1,664,150,401 to the power 3-4,608,692,391,106,630,458,516,931,201
-1,664,150,401 to the power 47,669,557,290,745,747,911,299,764,923,433,561,601
-1,664,150,401 to the power 5-12763296840887009975634416228… (48 digits)
First ten multiples-1,664,150,401, -3,328,300,802, -4,992,451,203, -6,656,601,604, -8,320,752,005, -9,984,902,406, -11,649,052,807, -13,313,203,208, -14,977,353,609, -16,641,504,010
Powers of twoBetween 2^30 (1,073,741,824) and 2^31 (2,147,483,648)
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 1
Divisible by 12No, remainder 1
Divisible by 100No, remainder 1
As a percentage & fraction
As a percentage-166,415,040,100%
-1,664,150,401% as a decimal-16,641,504.01
-1,664,150,401% of 100-1,664,150,401
-1,664,150,401% of 1,000-16,641,504,010
As a fraction of 100-1,664,150,401/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,664,150,401
Also reads as
1664150401 (identifier)
- 10 characters
- Checksum fails
1664150401 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