Recognised as Number

1,214,461

Positive
Odd
Composite
7 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value1,214,461

Digit count7

Digit sum19

Digit product192

Multiplicative persistence3times the digit product can be taken before one digit is left

Digital root1repeated digit sum

PalindromicNoreads differently backwards

Triangular numberYes, the 1,558th triangular number

Happy numberNosquared-digit sums reach 1

Harshad numberYesdivisible by its own digit sum

Factors & divisors

Prime factorisation19 × 41 × 1,559

Distinct prime factors319, 41, 1,559

Number of divisors8

Sum of divisors σ(n)1,310,400

Aliquot sum95,939sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)1,121,760integers below n that share no factor with it

Carmichael function λ(n)280,440the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,121,760

Möbius function μ(n)−13 distinct prime factors, an odd number of them

SquarefreeYesno repeated prime factor

All divisors1, 19, 41, 779, 1,559, 29,621, 63,919, 1,214,4618 in total

Arithmetic

Previous number1,214,460

Next number1,214,462

Double2,428,922

Half607,230.5

Square1,474,915,520,521

Cube1,791,227,377,967,454,181

Square root1,102.025861766≈irrational, shown to 9 decimal places

Cube root106.691017661≈

Negation-1,214,461

Reciprocal8.2341055 × 10^-7≈

Representations

Decimal1,214,461

Binary10010100001111111110121 bits

Octal4503775

Hexadecimal1287FD

Base 36Q131

Roman numeralNot defined above 3,999there is no agreed standard notation

In wordsone million, two hundred and fourteen thousand, four hundred and sixty-one

Ordinalone million, two hundred and fourteen thousand, four hundred and sixty-first

Scientific notation1.214461 × 10^6

Engineering notation1.214461 × 10^6

In other bases

Ternary2021200221001base 3; the most digit-efficient integer base after e: 13 digits

Quinary302330321base 5; one hand: 9 digits

Septenary13215463base 7: 8 digits

Nonary2250831base 9; each digit is two ternary digits: 7 digits

Duodecimal4a6991base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits

Vigesimal7bg31base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits

Sexagesimal5:37:21:1base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

Balanced ternary1T10TT010T1001digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed

Negabinary101111001100000001101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000000100101000011111111101

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

Bytes312 87 fd

Gray code110111100010000000011n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000000100101000011111111101

64-bit0000000000000000000000000000000000000000000100101000011111111101

One's complement11111111111011010111100000000010at 32 bits, every bit flipped

Bits reversed10111111111000010100100000000000at 32 bits

Rotated left by 100000000001001010000111111111010at 32 bits, wrapping

Shifted left by 11001010000111111111010= 2,428,922, no wrap

Shifted right by 110010100001111111110= 607,230, discarding the low bit

These bits as a double6.00023458 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime1,214,471+10

Previous prime1,214,459−2

Distance to nearest prime2

Nearest square below1,214,404

Nearest square above1,216,609

Powers & multiples

1,214,461 to the power 21,474,915,520,521

1,214,461 to the power 31,791,227,377,967,454,181

1,214,461 to the power 42,175,375,792,673,732,372,111,441

1,214,461 to the power 52,641,909,060,546,333,690,366,832,748,301

First ten multiples1,214,461, 2,428,922, 3,643,383, 4,857,844, 6,072,305, 7,286,766, 8,501,227, 9,715,688, 10,930,149, 12,144,610

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 5No, remainder 1

Divisible by 6No, remainder 1

Divisible by 7No, remainder 3

Divisible by 8No, remainder 5

Divisible by 9No, remainder 1

Divisible by 10No, remainder 1

Divisible by 11No, remainder 6

Divisible by 12No, remainder 1

Divisible by 100No, remainder 61

Collatz (3n + 1) trajectory

Steps to reach 1204the total stopping time

Highest value reached44,317,20436× the starting value

Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven

First steps1,214,461 → 3,643,384 → 1,821,692 → 910,846 → 455,423 → 1,366,270 → 683,135 → 2,049,406 → 1,024,703 → 3,074,110 → …

Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage121,446,100%

1,214,461% as a decimal12,144.61

1,214,461% of 1001,214,461

1,214,461% of 1,00012,144,610

As a fraction of 1001,214,461/100

Read another way

As seconds14 days, 1 hour and 21 minutes

As bytes1.158 MiB

As a 24-bit colour#1287FD

Keep nerding

Every link below is a page Nerdulator can generate from what it already knows about this value.