Recognised as Number
-15,032,013
- Negative
- Odd
- 8 digits
-15,032,013 is an odd 8-digit integer and the negative of 15,032,013. It has 4 divisors and a digital root of 6.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value15,032,013
Digit count8
Digit sum15
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root6repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 3 × 5,010,671
Distinct prime factors23, 5,010,671
Number of divisors4
Sum of divisors σ(n)20,042,688
SquarefreeYesno repeated prime factor
All divisors1, 3, 5,010,671, 15,032,0134 in total
Arithmetic
Previous number-15,032,014
Next number-15,032,012
Double-30,064,026
Half-7,516,006.5
Square225,961,414,832,169
Cube-3,396,654,925,255,557,226,197
Cube root-246.796529095≈
Negation15,032,013
Reciprocal-6.65246897 × 10^-8≈
Representations
Decimal-15,032,013
Binary11100101010111101100110124 bits
Octal71257315
HexadecimalE55ECD
Base 368Y6RX
In wordsminus fifteen million, thirty-two thousand and thirteen
Ordinalminus fifteen million, thirty-two thousand and thirteenth
Scientific notation-1.5032013 × 10^7
Engineering notation-15.032013 × 10^6
In other bases
Ternary1001021201001020base 3; the most digit-efficient integer base after e: 16 digits
Quinary12322011023base 5; one hand: 11 digits
Septenary241525053base 7: 9 digits
Nonary31251036base 9; each digit is two ternary digits: 8 digits
Duodecimal504b0b9base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal4dj00dbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal1:9:35:33:33base 60; Babylonian, and still how an hour and a circle are divided: 5 digits
Balanced ternaryT00TT0110T00TT10digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11011011111110000101110111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111000110101010000100110011
Bit length24 bitsto write the magnitude
Set bits15the population count, or Hamming weight
Zero bits9within that length
Bit parityodd15 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 23worth 8,388,608
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes3e5 5e cd
Gray code100101111111000110101011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111000110101010000100110011two's complement
64-bit1111111111111111111111111111111111111111000110101010000100110011two's complement
One's complement00000000111001010101111011001100at 32 bits, every bit flipped
Bits reversed11001100100001010101100011111111at 32 bits
Rotated left by 111111110001101010100001001100111at 32 bits, wrapping
Shifted left by 1-1110010101011110110011010= -30,064,026, no wrap
Shifted right by 1-11100101010111101100111= -7,516,006, discarding the low bit
These bits as a double7.42680121 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
-15,032,013 to the power 2225,961,414,832,169
-15,032,013 to the power 3-3,396,654,925,255,557,226,197
-15,032,013 to the power 451,058,560,992,955,564,546,437,244,561
-15,032,013 to the power 5-767,512,952,607,400,954,684,383,763,925,131,293
First ten multiples-15,032,013, -30,064,026, -45,096,039, -60,128,052, -75,160,065, -90,192,078, -105,224,091, -120,256,104, -135,288,117, -150,320,130
Powers of twoBetween 2^23 (8,388,608) and 2^24 (16,777,216)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 1
Divisible by 5No, remainder 3
Divisible by 6No, remainder 3
Divisible by 7No, remainder 3
Divisible by 8No, remainder 5
Divisible by 9No, remainder 6
Divisible by 10No, remainder 3
Divisible by 11No, remainder 7
Divisible by 12No, remainder 9
Divisible by 100No, remainder 13
As a percentage & fraction
As a percentage-1,503,201,300%
-15,032,013% as a decimal-150,320.13
-15,032,013% of 100-15,032,013
-15,032,013% of 1,000-150,320,130
As a fraction of 100-15,032,013/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Neighbouring numbers
Derived from -15,032,013
Also reads as
15032013 (identifier)
- 8 characters
- Checksum fails
15032013 matches the shape of Luhn (cards, IMEI), GTIN-8 (EAN-8), ISSN. 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-8 (EAN-8)Check digit does not matchGS1 mod 10, weights 3 and 1 alternating from the right
ISSNCheck digit does not matchmod 11 with weights 8 down to 2; the check may be X
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