Recognised as Number

1,415,065

Positive
Odd
Composite
7 digits

1,415,065 is an odd 7-digit integer and a composite number. It has 8 divisors and a digital root of 4.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value1,415,065

Digit count7

Digit sum22

Digit product0zero, because one of the digits is zero

Multiplicative persistence1times the digit product can be taken before one digit is left

Digital root4repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation5 × 37 × 7,649

Distinct prime factors35, 37, 7,649

Number of divisors8

Sum of divisors σ(n)1,744,200

Aliquot sum329,135sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)1,101,312integers below n that share no factor with it

Carmichael function λ(n)68,832the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,101,312

Möbius function μ(n)−13 distinct prime factors, an odd number of them

SquarefreeYesno repeated prime factor

All divisors1, 5, 37, 185, 7,649, 38,245, 283,013, 1,415,0658 in total

Arithmetic

Previous number1,415,064

Next number1,415,066

Double2,830,130

Half707,532.5

Square2,002,408,954,225

Cube2,833,538,826,810,399,625

Square root1,189.565046561≈irrational, shown to 9 decimal places

Cube root112.268726528≈

Negation-1,415,065

Reciprocal7.06681319 × 10^-7≈

Representations

Decimal1,415,065

Binary10101100101111001100121 bits

Octal5313631

Hexadecimal159799

Base 36UBVD

Roman numeralNot defined above 3,999there is no agreed standard notation

In wordsone million, four hundred and fifteen thousand and sixty-five

Ordinalone million, four hundred and fifteen thousand and sixty-fifth

Scientific notation1.415065 × 10^6

Engineering notation1.415065 × 10^6

In other bases

Ternary2122220002211base 3; the most digit-efficient integer base after e: 13 digits

Quinary330240230base 5; one hand: 9 digits

Septenary15012361base 7: 8 digits

Nonary2586084base 9; each digit is two ternary digits: 7 digits

Duodecimal582aa1base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits

Vigesimal8ghd5base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits

Sexagesimal6:33:4:25base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

Balanced ternary10T000T0010T11digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed

Negabinary11010101110100011101001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000000101011001011110011001

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

Bytes315 97 99

Gray code111110101110001010101n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000000101011001011110011001

64-bit0000000000000000000000000000000000000000000101011001011110011001

One's complement11111111111010100110100001100110at 32 bits, every bit flipped

Bits reversed10011001111010011010100000000000at 32 bits

Rotated left by 100000000001010110010111100110010at 32 bits, wrapping

Shifted left by 11010110010111100110010= 2,830,130, no wrap

Shifted right by 110101100101111001100= 707,532, discarding the low bit

These bits as a double6.99135003 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime1,415,069+4

Previous prime1,415,059−6

Distance to nearest prime4

Nearest square below1,413,721

Nearest square above1,416,100

Powers & multiples

1,415,065 to the power 22,002,408,954,225

1,415,065 to the power 32,833,538,826,810,399,625

1,415,065 to the power 44,009,641,619,960,458,145,350,625

1,415,065 to the power 55,673,903,518,949,345,705,450,582,165,625

First ten multiples1,415,065, 2,830,130, 4,245,195, 5,660,260, 7,075,325, 8,490,390, 9,905,455, 11,320,520, 12,735,585, 14,150,650

Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 1

Divisible by 4No, remainder 1

Divisible by 5Yes

Divisible by 6No, remainder 1

Divisible by 7No, remainder 1

Divisible by 8No, remainder 1

Divisible by 9No, remainder 4

Divisible by 10No, remainder 5

Divisible by 11No, remainder 3

Divisible by 12No, remainder 1

Divisible by 100No, remainder 65

Collatz (3n + 1) trajectory

Steps to reach 1199the total stopping time

Highest value reached4,775,8483× the starting value

Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven

First steps1,415,065 → 4,245,196 → 2,122,598 → 1,061,299 → 3,183,898 → 1,591,949 → 4,775,848 → 2,387,924 → 1,193,962 → 596,981 → …

Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage141,506,500%

1,415,065% as a decimal14,150.65

1,415,065% of 1001,415,065

1,415,065% of 1,00014,150,650

As a fraction of 1001,415,065/100

Read another way

As seconds16 days, 9 hours and 4 minutes

As bytes1.35 MiB

As a 24-bit colour#159799

Keep nerding

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