Nerdulator> put something in

Recognised as Number

1,397,690

  • Positive
  • Even
  • Composite
  • 7 digits

1,397,690 is an even 7-digit integer and a composite number. It has 32 divisors and a digital root of 8.

Number properties

ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value1,397,690
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 numberYesdivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 5 × 7 × 41 × 487
Distinct prime factors52, 5, 7, 41, 487
Number of divisors32
Sum of divisors σ(n)2,951,424
Aliquot sum1,553,734sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)466,560integers below n that share no factor with it
Carmichael function λ(n)9,720the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 466,560
Möbius function μ(n)−15 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 5, 7, 10, 14, 35, 41, 70, 82, 205, 287, 410, 487, 574, 974, 1,435, 2,435, 2,870, 3,409, 4,870, 6,818, 17,045, 19,967, 34,090, 39,934, 99,835, 139,769, 199,670, 279,538, 698,845, 1,397,69032 in total

Arithmetic

Previous number1,397,689
Next number1,397,691
Double2,795,380
Cube2,730,439,599,293,609,000
Square root1,182.23940046≈irrational, shown to 9 decimal places
Cube root111.807332445≈
Negation-1,397,690
Reciprocal7.15466234 × 10^-7≈

Representations

Decimal1,397,690
Binary10101010100111011101021 bits
Octal5251672
Hexadecimal1553BA
Base 36TYGQ
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, three hundred and ninety-seven thousand, six hundred and ninety
Ordinalone million, three hundred and ninety-seven thousand, six hundred and ninetieth
Scientific notation1.39769 × 10^6
Engineering notation1.39769 × 10^6

In other bases

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

Bit-level

00000000000101010101001110111010
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 even
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes315 53 ba
Gray code111111111101001100111n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000000101010101001110111010
64-bit0000000000000000000000000000000000000000000101010101001110111010
One's complement11111111111010101010110001000101at 32 bits, every bit flipped
Bits reversed01011101110010101010100000000000at 32 bits
Rotated left by 100000000001010101010011101110100at 32 bits, wrapping
Shifted left by 11010101010011101110100= 2,795,380, no wrap
Shifted right by 110101010100111011101= 698,845, discarding the low bit
These bits as a double6.90550613 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime1,397,717+27
Previous prime1,397,681−9
Distance to nearest prime9
Nearest square below1,397,124
Nearest square above1,399,489

Powers & multiples

1,397,690 to the power 21,953,537,336,100
1,397,690 to the power 32,730,439,599,293,609,000
1,397,690 to the power 43,816,308,123,536,684,363,210,000
1,397,690 to the power 55,334,015,701,185,988,367,614,984,900,000
First ten multiples1,397,690, 2,795,380, 4,193,070, 5,590,760, 6,988,450, 8,386,140, 9,783,830, 11,181,520, 12,579,210, 13,976,900
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 7Yes
Divisible by 8No, remainder 2
Divisible by 9No, remainder 8
Divisible by 10Yes
Divisible by 11No, remainder 8
Divisible by 12No, remainder 2
Divisible by 100No, remainder 90

Collatz (3n + 1) trajectory

Steps to reach 175the total stopping time
Highest value reached2,096,5361× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,397,690 → 698,845 → 2,096,536 → 1,048,268 → 524,134 → 262,067 → 786,202 → 393,101 → 1,179,304 → 589,652 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage139,769,000%
1,397,690% as a decimal13,976.9
1,397,690% of 1001,397,690
1,397,690% of 1,00013,976,900
As a fraction of 1001,397,690/100

Read another way

As bytes1.333 MiB
As a 24-bit colour#1553BA

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 “1397690” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.