Nerdulator> put something in

Recognised as Number

-1,012,048,064

  • Negative
  • Even
  • Perfect cube
  • 10 digits

-1,012,048,064 is an even 10-digit integer and the negative of 1,012,048,064. It has 28 divisors and a digital root of 8.

Number properties

ParityEvendivisible by 2
SignNegative
Absolute value1,012,048,064
Digit count10
Digit sum26
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Perfect cubeYes, -1,004³

Factors & divisors

Prime factorisation−1 × 2^6 × 251^3
Distinct prime factors22, 251
Number of divisors28
Sum of divisors σ(n)2,016,316,008
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 8, 16, 32, 64, 251, 502, 1,004, 2,008, 4,016, 8,032, 16,064, 63,001, 126,002, 252,004, 504,008, 1,008,016, 2,016,032, 4,032,064, 15,813,251, 31,626,502, 63,253,004, 126,506,008, 253,012,016, 506,024,032, 1,012,048,06428 in total

Arithmetic

Previous number-1,012,048,065
Next number-1,012,048,063
Square1,024,241,283,846,148,096
Cube-1,036,581,408,385,368,654,414,086,144
Cube root-1,004
Reciprocal-9.88095364 × 10^-10

Representations

Decimal-1,012,048,064
Binary11110001010010101000001100000030 bits
Octal7424520300
Hexadecimal3C52A0C0
Base 36GQJPA8
In wordsminus one billion, twelve million, forty-eight thousand and sixty-four
Ordinalminus one billion, twelve million, forty-eight thousand and sixty-fourth
Scientific notation-1.01204806 × 10^9
Engineering notation-1.012048 × 10^9

In other bases

Ternary2121112100100221122base 3; the most digit-efficient integer base after e: 19 digits
Quinary4033041014224base 5; one hand: 13 digits
Septenary34036160306base 7: 11 digits
Nonary2545310848base 9; each digit is two ternary digits: 10 digits
Duodecimal242b23b68base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 9 digits
Vigesimalfg56034base 20; hands and feet, and the Mayan and Yoruba systems: 7 digits
Sexagesimal1:18:5:24:27:44base 60; Babylonian, and still how an hour and a circle are divided: 6 digits
Balanced ternaryT0101111T00T0T001101digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11000100111100101010001101000000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

11000011101011010101111101000000
Bit length30 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits19within that length
Bit parityodd11 set bits, so odd; not the same as the number itself being even
Highest set bitbit 29worth 536,870,912
Lowest set bitbit 66 trailing zeros
Power of twoNo
Bytes43c 52 a0 c0
Gray code100010011110111111000010100000n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit11000011101011010101111101000000two's complement
64-bit1111111111111111111111111111111111000011101011010101111101000000two's complement
One's complement00111100010100101010000010111111at 32 bits, every bit flipped
Bits reversed00000010111110101011010111000011at 32 bits
Rotated left by 110000111010110101011111010000001at 32 bits, wrapping
Shifted left by 1-1111000101001010100000110000000= -2,024,096,128, no wrap
Shifted right by 1-11110001010010101000001100000= -506,024,032, discarding the low bit
These bits as a double5.0001818 × 10^-315IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime2+1,012,048,066
Nearest square below1,012,003,344
Nearest square above1,012,066,969

Powers & multiples

-1,012,048,064 to the power 21,024,241,283,846,148,096
-1,012,048,064 to the power 3-1,036,581,408,385,368,654,414,086,144
-1,012,048,064 to the power 41,049,070,207,534,805,712,626,060,936,364,425,216
-1,012,048,064 to the power 5-10617094725356783340793453265… (47 digits)
First ten multiples-1,012,048,064, -2,024,096,128, -3,036,144,192, -4,048,192,256, -5,060,240,320, -6,072,288,384, -7,084,336,448, -8,096,384,512, -9,108,432,576, -10,120,480,640
Powers of twoBetween 2^29 (536,870,912) and 2^30 (1,073,741,824)

Divisibility tests

Divisible by 2Yes
Divisible by 3No, remainder 2
Divisible by 4Yes
Divisible by 5No, remainder 4
Divisible by 6No, remainder 2
Divisible by 7No, remainder 6
Divisible by 8Yes
Divisible by 9No, remainder 8
Divisible by 10No, remainder 4
Divisible by 11No, remainder 5
Divisible by 12No, remainder 8
Divisible by 100No, remainder 64

As a percentage & fraction

As a percentage-101,204,806,400%
-1,012,048,064% as a decimal-10,120,480.64
-1,012,048,064% of 100-1,012,048,064
-1,012,048,064% of 1,000-10,120,480,640
As a fraction of 100-1,012,048,064/100

Keep nerding

Every link below is a page Nerdulator can generate from what it already knows about this value.

Also reads as

1012048064 (identifier)

  • 10 characters
  • Checksum fails

1012048064 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.

Open this reading on its own page →

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

Every value on this page was computed from “-1012048064” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.