Nerdulator> put something in

Recognised as Number

1,150,461

  • Positive
  • Odd
  • Composite
  • 7 digits

1,150,461 is an odd 7-digit integer and a composite number. It has 12 divisors and a digital root of 9.

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,150,461
Digit count7
Digit sum18
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times 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 factorisation3^2 × 13 × 9,833
Distinct prime factors33, 13, 9,833
Number of divisors12
Sum of divisors σ(n)1,789,788
Aliquot sum639,327sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)707,904integers below n that share no factor with it
Carmichael function λ(n)29,496the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 707,904
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 3, 9, 13, 39, 117, 9,833, 29,499, 88,497, 127,829, 383,487, 1,150,46112 in total

Arithmetic

Previous number1,150,460
Next number1,150,462
Double2,300,922
Cube1,522,704,750,795,422,181
Square root1,072.595450298≈irrational, shown to 9 decimal places
Cube root104.782953009≈
Negation-1,150,461
Reciprocal8.69216775 × 10^-7≈

Representations

Decimal1,150,461
Binary10001100011011111110121 bits
Octal4306775
Hexadecimal118DFD
Base 36ONP9
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, one hundred and fifty thousand, four hundred and sixty-one
Ordinalone million, one hundred and fifty thousand, four hundred and sixty-first
Scientific notation1.150461 × 10^6
Engineering notation1.150461 × 10^6

In other bases

Ternary2011110010200base 3; the most digit-efficient integer base after e: 13 digits
Quinary243303321base 5; one hand: 9 digits
Septenary12531054base 7: 8 digits
Nonary2143120base 9; each digit is two ternary digits: 7 digits
Duodecimal475939base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal73g31base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal5:19:34:21base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T011110011T00digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101101001001000001101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000000100011000110111111101
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 odd
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes311 8d fd
Gray code110010100101100000011n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000000100011000110111111101
64-bit0000000000000000000000000000000000000000000100011000110111111101
One's complement11111111111011100111001000000010at 32 bits, every bit flipped
Bits reversed10111111101100011000100000000000at 32 bits
Rotated left by 100000000001000110001101111111010at 32 bits, wrapping
Shifted left by 11000110001101111111010= 2,300,922, no wrap
Shifted right by 110001100011011111110= 575,230, discarding the low bit
These bits as a double5.68403257 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime1,150,489+28
Previous prime1,150,447−14
Distance to nearest prime14
Nearest square below1,149,184
Nearest square above1,151,329

Powers & multiples

1,150,461 to the power 21,323,560,512,521
1,150,461 to the power 31,522,704,750,795,422,181
1,150,461 to the power 41,751,812,430,304,852,197,775,441
1,150,461 to the power 52,015,391,880,380,950,564,304,931,628,301
First ten multiples1,150,461, 2,300,922, 3,451,383, 4,601,844, 5,752,305, 6,902,766, 8,053,227, 9,203,688, 10,354,149, 11,504,610
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)

Divisibility tests

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

Collatz (3n + 1) trajectory

Steps to reach 198the total stopping time
Highest value reached9,828,3768× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,150,461 → 3,451,384 → 1,725,692 → 862,846 → 431,423 → 1,294,270 → 647,135 → 1,941,406 → 970,703 → 2,912,110 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage115,046,100%
1,150,461% as a decimal11,504.61
1,150,461% of 1001,150,461
1,150,461% of 1,00011,504,610
As a fraction of 1001,150,461/100

Read another way

As bytes1.097 MiB
As a 24-bit colour#118DFD

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