Nerdulator> put something in

Recognised as Number

1,398,770

  • Positive
  • Even
  • Composite
  • 7 digits

1,398,770 is an even 7-digit integer and a composite number. It has 16 divisors and a digital root of 8.

Number properties

ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value1,398,770
Digit count7
Digit sum35
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 5 × 137 × 1,021
Distinct prime factors42, 5, 137, 1,021
Number of divisors16
Sum of divisors σ(n)2,538,648
Aliquot sum1,139,878sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)554,880integers below n that share no factor with it
Carmichael function λ(n)2,040the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 554,880
Möbius function μ(n)+14 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 5, 10, 137, 274, 685, 1,021, 1,370, 2,042, 5,105, 10,210, 139,877, 279,754, 699,385, 1,398,77016 in total

Arithmetic

Previous number1,398,769
Next number1,398,771
Double2,797,540
Cube2,736,773,952,319,133,000
Square root1,182.696072539≈irrational, shown to 9 decimal places
Cube root111.836123004≈
Negation-1,398,770
Reciprocal7.14913817 × 10^-7≈

Representations

Decimal1,398,770
Binary10101010101111111001021 bits
Octal5253762
Hexadecimal1557F2
Base 36TZAQ
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, three hundred and ninety-eight thousand, seven hundred and seventy
Ordinalone million, three hundred and ninety-eight thousand, seven hundred and seventieth
Scientific notation1.39877 × 10^6
Engineering notation1.39877 × 10^6

In other bases

Ternary2122001202022base 3; the most digit-efficient integer base after e: 13 digits
Quinary324230040base 5; one hand: 9 digits
Septenary14614022base 7: 8 digits
Nonary2561668base 9; each digit is two ternary digits: 7 digits
Duodecimal575582base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal8egiabase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal6:28:32:50base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10T0T01TT1T10Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11010101010100000110110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000000101010101011111110010
Bit length21 bitsto write the magnitude
Set bits13the population count, or Hamming weight
Zero bits8within that length
Bit parityodd13 set bits, so odd; not the same as the number itself being even
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes315 57 f2
Gray code111111111110000001011n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000000101010101011111110010
64-bit0000000000000000000000000000000000000000000101010101011111110010
One's complement11111111111010101010100000001101at 32 bits, every bit flipped
Bits reversed01001111111010101010100000000000at 32 bits
Rotated left by 100000000001010101010111111100100at 32 bits, wrapping
Shifted left by 11010101010111111100100= 2,797,540, no wrap
Shifted right by 110101010101111111001= 699,385, discarding the low bit
These bits as a double6.91084203 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime1,398,773+3
Previous prime1,398,769−1
Distance to nearest prime1
Nearest square below1,397,124
Nearest square above1,399,489

Powers & multiples

1,398,770 to the power 21,956,557,512,900
1,398,770 to the power 32,736,773,952,319,133,000
1,398,770 to the power 43,828,117,301,285,433,666,410,000
1,398,770 to the power 55,354,655,637,519,026,049,564,315,700,000
First ten multiples1,398,770, 2,797,540, 4,196,310, 5,595,080, 6,993,850, 8,392,620, 9,791,390, 11,190,160, 12,588,930, 13,987,700
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)

Divisibility tests

Divisible by 2Yes
Divisible by 3No, remainder 2
Divisible by 4No, remainder 2
Divisible by 5Yes
Divisible by 6No, remainder 2
Divisible by 7No, remainder 2
Divisible by 8No, remainder 2
Divisible by 9No, remainder 8
Divisible by 10Yes
Divisible by 11No, remainder 10
Divisible by 12No, remainder 2
Divisible by 100No, remainder 70

Collatz (3n + 1) trajectory

Steps to reach 1168the total stopping time
Highest value reached19,141,10813× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,398,770 → 699,385 → 2,098,156 → 1,049,078 → 524,539 → 1,573,618 → 786,809 → 2,360,428 → 1,180,214 → 590,107 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage139,877,000%
1,398,770% as a decimal13,987.7
1,398,770% of 1001,398,770
1,398,770% of 1,00013,987,700
As a fraction of 1001,398,770/100

Read another way

As bytes1.334 MiB
As a 24-bit colour#1557F2

Keep nerding

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

Nerdulate something else

Nothing in mind? Surprise me · today’s page

Every value on this page was computed from “1398770” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.