Nerdulator> put something in

Recognised as Number

1,484,961

  • Positive
  • Odd
  • Composite
  • 7 digits

1,484,961 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 6.

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,484,961
Digit count7
Digit sum33
Digit product6,912
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root6repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3 × 494,987
Distinct prime factors23, 494,987
Number of divisors4
Sum of divisors σ(n)1,979,952
Aliquot sum494,991sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)989,972integers below n that share no factor with it
Carmichael function λ(n)494,986the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 989,972
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 3, 494,987, 1,484,9614 in total

Arithmetic

Previous number1,484,960
Next number1,484,962
Double2,969,922
Cube3,274,501,120,450,995,681
Square root1,218.589758697≈irrational, shown to 9 decimal places
Cube root114.087575059≈
Negation-1,484,961
Reciprocal6.73418359 × 10^-7≈

Representations

Decimal1,484,961
Binary10110101010001010000121 bits
Octal5524241
Hexadecimal16A8A1
Base 36VTSX
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, four hundred and eighty-four thousand, nine hundred and sixty-one
Ordinalone million, four hundred and eighty-four thousand, nine hundred and sixty-first
Scientific notation1.484961 × 10^6
Engineering notation1.484961 × 10^6

In other bases

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

Bit-level

00000000000101101010100010100001
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
Bytes316 a8 a1
Gray code111011111110011110001n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000000101101010100010100001
64-bit0000000000000000000000000000000000000000000101101010100010100001
One's complement11111111111010010101011101011110at 32 bits, every bit flipped
Bits reversed10000101000101010110100000000000at 32 bits
Rotated left by 100000000001011010101000101000010at 32 bits, wrapping
Shifted left by 11011010101000101000010= 2,969,922, no wrap
Shifted right by 110110101010001010000= 742,480, discarding the low bit
These bits as a double7.33668216 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime1,484,969+8
Previous prime1,484,947−14
Distance to nearest prime8
Nearest square below1,483,524
Nearest square above1,485,961

Powers & multiples

1,484,961 to the power 22,205,109,171,521
1,484,961 to the power 33,274,501,120,450,995,681
1,484,961 to the power 44,862,506,458,326,030,997,453,441
1,484,961 to the power 57,220,632,452,862,281,316,009,459,200,801
First ten multiples1,484,961, 2,969,922, 4,454,883, 5,939,844, 7,424,805, 8,909,766, 10,394,727, 11,879,688, 13,364,649, 14,849,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 2
Divisible by 8No, remainder 1
Divisible by 9No, remainder 6
Divisible by 10No, remainder 1
Divisible by 11No, remainder 5
Divisible by 12No, remainder 9
Divisible by 100No, remainder 61

Collatz (3n + 1) trajectory

Steps to reach 1181the total stopping time
Highest value reached6,343,0004× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,484,961 → 4,454,884 → 2,227,442 → 1,113,721 → 3,341,164 → 1,670,582 → 835,291 → 2,505,874 → 1,252,937 → 3,758,812 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage148,496,100%
1,484,961% as a decimal14,849.61
1,484,961% of 1001,484,961
1,484,961% of 1,00014,849,610
As a fraction of 1001,484,961/100

Read another way

As bytes1.416 MiB
As a 24-bit colour#16A8A1

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