Nerdulator> put something in

Recognised as Number

1,415,189

  • Positive
  • Odd
  • Composite
  • 7 digits

1,415,189 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 2.

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,415,189
Digit count7
Digit sum29
Digit product1,440
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation89 × 15,901
Distinct prime factors289, 15,901
Number of divisors4
Sum of divisors σ(n)1,431,180
Aliquot sum15,991sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,399,200integers below n that share no factor with it
Carmichael function λ(n)349,800the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,399,200
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 89, 15,901, 1,415,1894 in total

Arithmetic

Previous number1,415,188
Next number1,415,190
Double2,830,378
Cube2,834,283,788,217,396,269
Square root1,189.61716531≈irrational, shown to 9 decimal places
Cube root112.272005745≈
Negation-1,415,189
Reciprocal7.06619399 × 10^-7≈

Representations

Decimal1,415,189
Binary10101100110000001010121 bits
Octal5314025
Hexadecimal159815
Base 36UBYT
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, four hundred and fifteen thousand, one hundred and eighty-nine
Ordinalone million, four hundred and fifteen thousand, one hundred and eighty-ninth
Scientific notation1.415189 × 10^6
Engineering notation1.415189 × 10^6

In other bases

Ternary2122220021102base 3; the most digit-efficient integer base after e: 13 digits
Quinary330241224base 5; one hand: 9 digits
Septenary15012626base 7: 8 digits
Nonary2586242base 9; each digit is two ternary digits: 7 digits
Duodecimal582b85base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal8ghj9base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal6:33:6:29base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10T000T01T111Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11010101110100000010101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000000101011001100000010101
Bit length21 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits12within that length
Bit parityodd9 set bits, so odd; 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 98 15
Gray code111110101010000011111n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000000101011001100000010101
64-bit0000000000000000000000000000000000000000000101011001100000010101
One's complement11111111111010100110011111101010at 32 bits, every bit flipped
Bits reversed10101000000110011010100000000000at 32 bits
Rotated left by 100000000001010110011000000101010at 32 bits, wrapping
Shifted left by 11010110011000000101010= 2,830,378, no wrap
Shifted right by 110101100110000001010= 707,594, discarding the low bit
These bits as a double6.99196267 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime1,415,191+2
Previous prime1,415,179−10
Distance to nearest prime2
Nearest square below1,413,721
Nearest square above1,416,100

Powers & multiples

1,415,189 to the power 22,002,759,905,721
1,415,189 to the power 32,834,283,788,217,396,269
1,415,189 to the power 44,011,047,239,963,588,808,529,841
1,415,189 to the power 55,676,389,932,476,831,282,354,537,154,949
First ten multiples1,415,189, 2,830,378, 4,245,567, 5,660,756, 7,075,945, 8,491,134, 9,906,323, 11,321,512, 12,736,701, 14,151,890
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 2
Divisible by 4No, remainder 1
Divisible by 5No, remainder 4
Divisible by 6No, remainder 5
Divisible by 7No, remainder 6
Divisible by 8No, remainder 5
Divisible by 9No, remainder 2
Divisible by 10No, remainder 9
Divisible by 11No, remainder 6
Divisible by 12No, remainder 5
Divisible by 100No, remainder 89

Collatz (3n + 1) trajectory

Steps to reach 1106the total stopping time
Highest value reached4,245,5683× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,415,189 → 4,245,568 → 2,122,784 → 1,061,392 → 530,696 → 265,348 → 132,674 → 66,337 → 199,012 → 99,506 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage141,518,900%
1,415,189% as a decimal14,151.89
1,415,189% of 1001,415,189
1,415,189% of 1,00014,151,890
As a fraction of 1001,415,189/100

Read another way

As bytes1.35 MiB
As a 24-bit colour#159815

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