Recognised as Number
1,514,031
- Positive
- Odd
- Composite
- 7 digits
1,514,031 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 6.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,514,031
Digit count7
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
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3 × 504,677
Distinct prime factors23, 504,677
Number of divisors4
Sum of divisors σ(n)2,018,712
Aliquot sum504,681sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,009,352integers below n that share no factor with it
Carmichael function λ(n)504,676the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,009,352
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 3, 504,677, 1,514,0314 in total
Arithmetic
Previous number1,514,030
Next number1,514,032
Double3,028,062
Half757,015.5
Square2,292,289,868,961
Cube3,470,597,922,592,891,791
Square root1,230.459670205≈irrational, shown to 9 decimal places
Cube root114.827239021≈
Negation-1,514,031
Reciprocal6.60488458 × 10^-7≈
Representations
Decimal1,514,031
Binary10111000110100010111121 bits
Octal5615057
Hexadecimal171A2F
Base 36WG8F
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, five hundred and fourteen thousand and thirty-one
Ordinalone million, five hundred and fourteen thousand and thirty-first
Scientific notation1.514031 × 10^6
Engineering notation1.514031 × 10^6
In other bases
Ternary2211220212020base 3; the most digit-efficient integer base after e: 13 digits
Quinary341422111base 5; one hand: 9 digits
Septenary15604041base 7: 8 digits
Nonary2756766base 9; each digit is two ternary digits: 7 digits
Duodecimal610213base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal9951bbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal7:0:33:51base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary100TT0T10TT1T0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11010110110111001110011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000101110001101000101111
Bit length21 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits9within that length
Bit parityeven12 set bits, so even; not the same as the number itself being odd
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes317 1a 2f
Gray code111001001011100111000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000101110001101000101111
64-bit0000000000000000000000000000000000000000000101110001101000101111
One's complement11111111111010001110010111010000at 32 bits, every bit flipped
Bits reversed11110100010110001110100000000000at 32 bits
Rotated left by 100000000001011100011010001011110at 32 bits, wrapping
Shifted left by 11011100011010001011110= 3,028,062, no wrap
Shifted right by 110111000110100010111= 757,015, discarding the low bit
These bits as a double7.48030704 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,514,031 to the power 22,292,289,868,961
1,514,031 to the power 33,470,597,922,592,891,791
1,514,031 to the power 45,254,592,843,341,238,551,219,521
1,514,031 to the power 57,955,616,457,196,778,744,941,442,599,151
First ten multiples1,514,031, 3,028,062, 4,542,093, 6,056,124, 7,570,155, 9,084,186, 10,598,217, 12,112,248, 13,626,279, 15,140,310
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 3
Divisible by 5No, remainder 1
Divisible by 6No, remainder 3
Divisible by 7No, remainder 1
Divisible by 8No, remainder 7
Divisible by 9No, remainder 6
Divisible by 10No, remainder 1
Divisible by 11No, remainder 2
Divisible by 12No, remainder 3
Divisible by 100No, remainder 31
Collatz (3n + 1) trajectory
Steps to reach 1256the total stopping time
Highest value reached19,401,49612× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,514,031 → 4,542,094 → 2,271,047 → 6,813,142 → 3,406,571 → 10,219,714 → 5,109,857 → 15,329,572 → 7,664,786 → 3,832,393 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage151,403,100%
1,514,031% as a decimal15,140.31
1,514,031% of 1001,514,031
1,514,031% of 1,00015,140,310
As a fraction of 1001,514,031/100
Read another way
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from 1,514,031
Nerdulate something else
Nothing in mind? Surprise me · today’s page