Recognised as Number

1,399,959

Positive
Odd
Composite
7 digits

1,399,959 is an odd 7-digit integer and a composite number. It has 24 divisors and a digital root of 9.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value1,399,959

Digit count7

Digit sum45

Digit product98,415

Multiplicative persistence3times 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^2 × 11 × 79 × 179

Distinct prime factors43, 11, 79, 179

Number of divisors24

Sum of divisors σ(n)2,246,400

Aliquot sum846,441sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)34,710the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 833,040

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

SquarefreeNohas a repeated prime factor

All divisors1, 3, 9, 11, 33, 79, 99, 179, 237, 537, 711, 869, 1,611, 1,969, 2,607, 5,907, 7,821, 14,141, 17,721, 42,423, 127,269, 155,551, 466,653, 1,399,95924 in total

Arithmetic

Previous number1,399,958

Next number1,399,960

Double2,799,918

Half699,979.5

Square1,959,885,201,681

Cube2,743,758,927,060,131,079

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

Cube root111.867802144≈

Negation-1,399,959

Reciprocal7.14306633 × 10^-7≈

Representations

Decimal1,399,959

Binary10101010111001001011121 bits

Octal5256227

Hexadecimal155C97

Base 36U07R

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

In wordsone million, three hundred and ninety-nine thousand, nine hundred and fifty-nine

Ordinalone million, three hundred and ninety-nine thousand, nine hundred and fifty-ninth

Scientific notation1.399959 × 10^6

Engineering notation1.399959 × 10^6

In other bases

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

Quinary324244314base 5; one hand: 9 digits

Septenary14620341base 7: 8 digits

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

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

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

Sexagesimal6:28:52:39base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000000101010101110010010111

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 5c 97

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

At each machine width

32-bit00000000000101010101110010010111

64-bit0000000000000000000000000000000000000000000101010101110010010111

One's complement11111111111010101010001101101000at 32 bits, every bit flipped

Bits reversed11101001001110101010100000000000at 32 bits

Rotated left by 100000000001010101011100100101110at 32 bits, wrapping

Shifted left by 11010101011100100101110= 2,799,918, no wrap

Shifted right by 110101010111001001011= 699,979, discarding the low bit

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

Nearest landmarks

Next prime1,399,963+4

Previous prime1,399,943−16

Distance to nearest prime4

Nearest square below1,399,489

Nearest square above1,401,856

Powers & multiples

1,399,959 to the power 21,959,885,201,681

1,399,959 to the power 32,743,758,927,060,131,079

1,399,959 to the power 43,841,150,003,768,174,045,225,761

1,399,959 to the power 55,377,452,518,125,289,168,180,211,143,799

First ten multiples1,399,959, 2,799,918, 4,199,877, 5,599,836, 6,999,795, 8,399,754, 9,799,713, 11,199,672, 12,599,631, 13,999,590

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 4

Divisible by 6No, remainder 3

Divisible by 7No, remainder 1

Divisible by 8No, remainder 7

Divisible by 9Yes

Divisible by 10No, remainder 9

Divisible by 11Yes

Divisible by 12No, remainder 3

Divisible by 100No, remainder 59

Collatz (3n + 1) trajectory

Steps to reach 193the total stopping time

Highest value reached9,449,7286× the starting value

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

First steps1,399,959 → 4,199,878 → 2,099,939 → 6,299,818 → 3,149,909 → 9,449,728 → 4,724,864 → 2,362,432 → 1,181,216 → 590,608 → …

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

As a percentage & fraction

As a percentage139,995,900%

1,399,959% as a decimal13,999.59

1,399,959% of 1001,399,959

1,399,959% of 1,00013,999,590

As a fraction of 1001,399,959/100

Read another way

As seconds16 days, 4 hours and 52 minutes

As bytes1.335 MiB

As a 24-bit colour#155C97

Keep nerding

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