Recognised as Number

1,214,465

Positive
Odd
Composite
7 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value1,214,465

Digit count7

Digit sum23

Digit product960

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

Digital root5repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation5 × 7^2 × 4,957

Distinct prime factors35, 7, 4,957

Number of divisors12

Sum of divisors σ(n)1,695,636

Aliquot sum481,171sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)832,608integers below n that share no factor with it

Carmichael function λ(n)4,956the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 832,608

Möbius function μ(n)0zero, because a prime divides n twice

SquarefreeNohas a repeated prime factor

All divisors1, 5, 7, 35, 49, 245, 4,957, 24,785, 34,699, 173,495, 242,893, 1,214,46512 in total

Arithmetic

Previous number1,214,464

Next number1,214,466

Double2,428,930

Half607,232.5

Square1,474,925,236,225

Cube1,791,245,077,011,994,625

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

Cube root106.691134795≈

Negation-1,214,465

Reciprocal8.23407838 × 10^-7≈

Representations

Decimal1,214,465

Binary10010100010000000000121 bits

Octal4504001

Hexadecimal128801

Base 36Q135

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

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

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

Scientific notation1.214465 × 10^6

Engineering notation1.214465 × 10^6

In other bases

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

Quinary302330330base 5; one hand: 9 digits

Septenary13215500base 7: 8 digits

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

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

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

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

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

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

Bit-level

00000000000100101000100000000001

Bit length21 bitsto write the magnitude

Set bits5the population count, or Hamming weight

Zero bits16within that length

Bit parityodd5 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 88 01

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

At each machine width

32-bit00000000000100101000100000000001

64-bit0000000000000000000000000000000000000000000100101000100000000001

One's complement11111111111011010111011111111110at 32 bits, every bit flipped

Bits reversed10000000000100010100100000000000at 32 bits

Rotated left by 100000000001001010001000000000010at 32 bits, wrapping

Shifted left by 11001010001000000000010= 2,428,930, no wrap

Shifted right by 110010100010000000000= 607,232, discarding the low bit

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

Nearest landmarks

Next prime1,214,471+6

Previous prime1,214,459−6

Distance to nearest prime6

Nearest square below1,214,404

Nearest square above1,216,609

Powers & multiples

1,214,465 to the power 21,474,925,236,225

1,214,465 to the power 31,791,245,077,011,994,625

1,214,465 to the power 42,175,404,452,453,372,052,250,625

1,214,465 to the power 52,641,952,568,348,784,489,436,555,290,625

First ten multiples1,214,465, 2,428,930, 3,643,395, 4,857,860, 6,072,325, 7,286,790, 8,501,255, 9,715,720, 10,930,185, 12,144,650

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 5Yes

Divisible by 6No, remainder 5

Divisible by 7Yes

Divisible by 8No, remainder 1

Divisible by 9No, remainder 5

Divisible by 10No, remainder 5

Divisible by 11No, remainder 10

Divisible by 12No, remainder 5

Divisible by 100No, remainder 65

Collatz (3n + 1) trajectory

Steps to reach 1116the total stopping time

Highest value reached3,643,3963× the starting value

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

First steps1,214,465 → 3,643,396 → 1,821,698 → 910,849 → 2,732,548 → 1,366,274 → 683,137 → 2,049,412 → 1,024,706 → 512,353 → …

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

As a percentage & fraction

As a percentage121,446,500%

1,214,465% as a decimal12,144.65

1,214,465% of 1001,214,465

1,214,465% of 1,00012,144,650

As a fraction of 1001,214,465/100

Read another way

As seconds14 days, 1 hour and 21 minutes

As bytes1.158 MiB

As a 24-bit colour#128801

Keep nerding

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