Nerdulator> put something in

Recognised as Number

1,569,996

  • Positive
  • Even
  • Composite
  • 7 digits

1,569,996 is an even 7-digit integer and a composite number. It has 24 divisors and a digital root of 9.

Number properties

ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value1,569,996
Digit count7
Digit sum45
Digit product131,220
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 factorisation2^2 × 3^3 × 14,537
Distinct prime factors32, 3, 14,537
Number of divisors24
Sum of divisors σ(n)4,070,640
Aliquot sum2,500,644sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)523,296integers below n that share no factor with it
Carmichael function λ(n)130,824the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 523,296
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 3, 4, 6, 9, 12, 18, 27, 36, 54, 108, 14,537, 29,074, 43,611, 58,148, 87,222, 130,833, 174,444, 261,666, 392,499, 523,332, 784,998, 1,569,99624 in total

Arithmetic

Previous number1,569,995
Next number1,569,997
Double3,139,992
Cube3,869,863,421,275,359,936
Square root1,252.994812439≈irrational, shown to 9 decimal places
Cube root116.224989417≈
Negation-1,569,996
Reciprocal6.36944298 × 10^-7≈

Representations

Decimal1,569,996
Binary10111111101001100110021 bits
Octal5772314
Hexadecimal17F4CC
Base 36XNF0
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, five hundred and sixty-nine thousand, nine hundred and ninety-six
Ordinalone million, five hundred and sixty-nine thousand, nine hundred and ninety-sixth
Scientific notation1.569996 × 10^6
Engineering notation1.569996 × 10^6

In other bases

Ternary2221202122000base 3; the most digit-efficient integer base after e: 13 digits
Quinary400214441base 5; one hand: 9 digits
Septenary16226151base 7: 8 digits
Nonary2852560base 9; each digit is two ternary digits: 7 digits
Duodecimal638690base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal9g4jgbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal7:16:6:36base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1000TT10T0T000digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11010000011010111011100base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000000101111111010011001100
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 22 trailing zeros
Power of twoNo
Bytes317 f4 cc
Gray code111000000111010101010n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000000101111111010011001100
64-bit0000000000000000000000000000000000000000000101111111010011001100
One's complement11111111111010000000101100110011at 32 bits, every bit flipped
Bits reversed00110011001011111110100000000000at 32 bits
Rotated left by 100000000001011111110100110011000at 32 bits, wrapping
Shifted left by 11011111110100110011000= 3,139,992, no wrap
Shifted right by 110111111101001100110= 784,998, discarding the low bit
These bits as a double7.75681088 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime1,570,007+11
Previous prime1,569,983−13
Distance to nearest prime11
Nearest square below1,567,504
Nearest square above1,570,009

Powers & multiples

1,569,996 to the power 22,464,887,440,016
1,569,996 to the power 33,869,863,421,275,359,936
1,569,996 to the power 46,075,670,091,948,629,998,080,256
1,569,996 to the power 59,538,777,741,678,981,302,466,009,598,976
First ten multiples1,569,996, 3,139,992, 4,709,988, 6,279,984, 7,849,980, 9,419,976, 10,989,972, 12,559,968, 14,129,964, 15,699,960
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)

Divisibility tests

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

Collatz (3n + 1) trajectory

Steps to reach 1132the total stopping time
Highest value reached1,766,2481× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,569,996 → 784,998 → 392,499 → 1,177,498 → 588,749 → 1,766,248 → 883,124 → 441,562 → 220,781 → 662,344 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage156,999,600%
1,569,996% as a decimal15,699.96
1,569,996% of 1001,569,996
1,569,996% of 1,00015,699,960
As a fraction of 1001,569,996/100

Read another way

As bytes1.497 MiB
As a 24-bit colour#17F4CC

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