Recognised as Number

1,415,313

Positive
Odd
Composite
7 digits

1,415,313 is an odd 7-digit integer and a composite number. It has 20 divisors and a digital root of 9.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value1,415,313

Digit count7

Digit sum18

Digit product180

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

Digital root9repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3^4 × 101 × 173

Distinct prime factors33, 101, 173

Number of divisors20

Sum of divisors σ(n)2,147,508

Aliquot sum732,195sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)928,800integers below n that share no factor with it

Carmichael function λ(n)116,100the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 928,800

Möbius function μ(n)0zero, because a prime divides n twice

SquarefreeNohas a repeated prime factor

All divisors1, 3, 9, 27, 81, 101, 173, 303, 519, 909, 1,557, 2,727, 4,671, 8,181, 14,013, 17,473, 52,419, 157,257, 471,771, 1,415,31320 in total

Arithmetic

Previous number1,415,312

Next number1,415,314

Double2,830,626

Half707,656.5

Square2,003,110,887,969

Cube2,835,028,880,184,069,297

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

Cube root112.275284771≈

Negation-1,415,313

Reciprocal7.06557489 × 10^-7≈

Representations

Decimal1,415,313

Binary10101100110001001000121 bits

Octal5314221

Hexadecimal159891

Base 36UC29

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

In wordsone million, four hundred and fifteen thousand, three hundred and thirteen

Ordinalone million, four hundred and fifteen thousand, three hundred and thirteenth

Scientific notation1.415313 × 10^6

Engineering notation1.415313 × 10^6

In other bases

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

Quinary330242223base 5; one hand: 9 digits

Septenary15013164base 7: 8 digits

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

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

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

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

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

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

Bit-level

00000000000101011001100010010001

Bit length21 bitsto write the magnitude

Set bits9the population count, or Hamming weight

Zero bits12within that length

Bit parityodd9 set bits, so odd; 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 98 91

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

At each machine width

32-bit00000000000101011001100010010001

64-bit0000000000000000000000000000000000000000000101011001100010010001

One's complement11111111111010100110011101101110at 32 bits, every bit flipped

Bits reversed10001001000110011010100000000000at 32 bits

Rotated left by 100000000001010110011000100100010at 32 bits, wrapping

Shifted left by 11010110011000100100010= 2,830,626, no wrap

Shifted right by 110101100110001001000= 707,656, discarding the low bit

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

Nearest landmarks

Next prime1,415,317+4

Previous prime1,415,303−10

Distance to nearest prime4

Nearest square below1,413,721

Nearest square above1,416,100

Powers & multiples

1,415,313 to the power 22,003,110,887,969

1,415,313 to the power 32,835,028,880,184,069,297

1,415,313 to the power 44,012,453,229,499,955,668,944,961

1,415,313 to the power 55,678,877,217,603,270,757,681,499,587,793

First ten multiples1,415,313, 2,830,626, 4,245,939, 5,661,252, 7,076,565, 8,491,878, 9,907,191, 11,322,504, 12,737,817, 14,153,130

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 1

Divisible by 5No, remainder 3

Divisible by 6No, remainder 3

Divisible by 7No, remainder 4

Divisible by 8No, remainder 1

Divisible by 9Yes

Divisible by 10No, remainder 3

Divisible by 11No, remainder 9

Divisible by 12No, remainder 9

Divisible by 100No, remainder 13

Collatz (3n + 1) trajectory

Steps to reach 1150the total stopping time

Highest value reached9,683,7646× the starting value

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

First steps1,415,313 → 4,245,940 → 2,122,970 → 1,061,485 → 3,184,456 → 1,592,228 → 796,114 → 398,057 → 1,194,172 → 597,086 → …

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

As a percentage & fraction

As a percentage141,531,300%

1,415,313% as a decimal14,153.13

1,415,313% of 1001,415,313

1,415,313% of 1,00014,153,130

As a fraction of 1001,415,313/100

Read another way

As seconds16 days, 9 hours and 8 minutes

As bytes1.35 MiB

As a 24-bit colour#159891

Keep nerding

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