Nerdulator> put something in

Recognised as Number

1,600,225

  • Positive
  • Odd
  • Composite
  • Perfect square
  • 7 digits

1,600,225 is an odd 7-digit integer and a composite number. It has 27 divisors and a digital root of 7.

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,600,225
Digit count7
Digit sum16
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Perfect squareYes, 1,265²
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation5^2 × 11^2 × 23^2
Distinct prime factors35, 11, 23
Number of divisors27
Sum of divisors σ(n)2,280,019
Aliquot sum679,794sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,113,200integers below n that share no factor with it
Carmichael function λ(n)5,060the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,113,200
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 5, 11, 23, 25, 55, 115, 121, 253, 275, 529, 575, 605, 1,265, 2,645, 2,783, 3,025, 5,819, 6,325, 13,225, 13,915, 29,095, 64,009, 69,575, 145,475, 320,045, 1,600,22527 in total

Arithmetic

Previous number1,600,224
Next number1,600,226
Double3,200,450
Cube4,097,728,243,011,390,625
Square root1,265exact
Cube root116.966191805≈
Negation-1,600,225
Reciprocal6.24912122 × 10^-7≈

Representations

Decimal1,600,225
Binary11000011010101110000121 bits
Octal6065341
Hexadecimal186AE1
Base 36YAQP
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, six hundred thousand, two hundred and twenty-five
Ordinalone million, six hundred thousand, two hundred and twenty-fifth
Scientific notation1.600225 × 10^6
Engineering notation1.600225 × 10^6

In other bases

Ternary10000022002121base 3; the most digit-efficient integer base after e: 14 digits
Quinary402201400base 5; one hand: 9 digits
Septenary16413244base 7: 8 digits
Nonary3008077base 9; each digit is two ternary digits: 7 digits
Duodecimal652081base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimala00b5base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal7:24:30:25base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1000010T010TT1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11010011011111100100001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000000110000110101011100001
Bit length21 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits11within that length
Bit parityeven10 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
Bytes318 6a e1
Gray code101000101111110010001n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000000110000110101011100001
64-bit0000000000000000000000000000000000000000000110000110101011100001
One's complement11111111111001111001010100011110at 32 bits, every bit flipped
Bits reversed10000111010101100001100000000000at 32 bits
Rotated left by 100000000001100001101010111000010at 32 bits, wrapping
Shifted left by 11100001101010111000010= 3,200,450, no wrap
Shifted right by 111000011010101110000= 800,112, discarding the low bit
These bits as a double7.90616198 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime1,600,241+16
Previous prime1,600,223−2
Distance to nearest prime2
Nearest square below1,600,225
Nearest square above1,602,756

Powers & multiples

1,600,225 to the power 22,560,720,050,625
1,600,225 to the power 34,097,728,243,011,390,625
1,600,225 to the power 46,557,287,177,672,902,562,890,625
1,600,225 to the power 510,493,134,873,891,620,503,701,650,390,625
First ten multiples1,600,225, 3,200,450, 4,800,675, 6,400,900, 8,001,125, 9,601,350, 11,201,575, 12,801,800, 14,402,025, 16,002,250
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)

Divisibility tests

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

Collatz (3n + 1) trajectory

Steps to reach 1194the total stopping time
Highest value reached17,301,97610× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,600,225 → 4,800,676 → 2,400,338 → 1,200,169 → 3,600,508 → 1,800,254 → 900,127 → 2,700,382 → 1,350,191 → 4,050,574 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage160,022,500%
1,600,225% as a decimal16,002.25
1,600,225% of 1001,600,225
1,600,225% of 1,00016,002,250
As a fraction of 1001,600,225/100

Read another way

As bytes1.526 MiB
As a 24-bit colour#186AE1

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