Recognised as Number

1,465,434

Positive
Even
Composite
7 digits

1,465,434 is an even 7-digit integer and a composite number. It has 24 divisors and a digital root of 9.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value1,465,434

Digit count7

Digit sum27

Digit product5,760

Multiplicative persistence2times 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 factorisation2 × 3^2 × 17 × 4,789

Distinct prime factors42, 3, 17, 4,789

Number of divisors24

Sum of divisors σ(n)3,362,580

Aliquot sum1,897,146sum of the proper divisors

ClassificationAbundantthe aliquot sum exceeds the number

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

Carmichael function λ(n)19,152the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 459,648

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

SquarefreeNohas a repeated prime factor

All divisors1, 2, 3, 6, 9, 17, 18, 34, 51, 102, 153, 306, 4,789, 9,578, 14,367, 28,734, 43,101, 81,413, 86,202, 162,826, 244,239, 488,478, 732,717, 1,465,43424 in total

Arithmetic

Previous number1,465,433

Next number1,465,435

Double2,930,868

Half732,717

Square2,147,496,808,356

Cube3,147,014,837,856,366,504

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

Cube root113.585289125≈

Negation-1,465,434

Reciprocal6.82391701 × 10^-7≈

Representations

Decimal1,465,434

Binary10110010111000101101021 bits

Octal5456132

Hexadecimal165C5A

Base 36VEQI

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

In wordsone million, four hundred and sixty-five thousand, four hundred and thirty-four

Ordinalone million, four hundred and sixty-five thousand, four hundred and thirty-fourth

Scientific notation1.465434 × 10^6

Engineering notation1.465434 × 10^6

In other bases

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

Quinary333343214base 5; one hand: 9 digits

Septenary15312255base 7: 8 digits

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

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

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

Sexagesimal6:47:3:54base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000000101100101110001011010

Bit length21 bitsto write the magnitude

Set bits11the population count, or Hamming weight

Zero bits10within that length

Bit parityodd11 set bits, so odd; not the same as the number itself being even

Highest set bitbit 20worth 1,048,576

Lowest set bitbit 11 trailing zero

Power of twoNo

Bytes316 5c 5a

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

At each machine width

32-bit00000000000101100101110001011010

64-bit0000000000000000000000000000000000000000000101100101110001011010

One's complement11111111111010011010001110100101at 32 bits, every bit flipped

Bits reversed01011010001110100110100000000000at 32 bits

Rotated left by 100000000001011001011100010110100at 32 bits, wrapping

Shifted left by 11011001011100010110100= 2,930,868, no wrap

Shifted right by 110110010111000101101= 732,717, discarding the low bit

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

Nearest landmarks

Next prime1,465,439+5

Previous prime1,465,433−1

Distance to nearest prime1

Nearest square below1,464,100

Nearest square above1,466,521

Powers & multiples

1,465,434 to the power 22,147,496,808,356

1,465,434 to the power 33,147,014,837,856,366,504

1,465,434 to the power 44,611,742,541,899,206,591,422,736

1,465,434 to the power 56,758,204,320,145,521,912,094,985,707,424

First ten multiples1,465,434, 2,930,868, 4,396,302, 5,861,736, 7,327,170, 8,792,604, 10,258,038, 11,723,472, 13,188,906, 14,654,340

Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)

Divisibility tests

Divisible by 2Yes

Divisible by 3Yes

Divisible by 4No, remainder 2

Divisible by 5No, remainder 4

Divisible by 6Yes

Divisible by 7No, remainder 5

Divisible by 8No, remainder 2

Divisible by 9Yes

Divisible by 10No, remainder 4

Divisible by 11No, remainder 3

Divisible by 12No, remainder 6

Divisible by 100No, remainder 34

Collatz (3n + 1) trajectory

Steps to reach 162the total stopping time

Highest value reached2,198,1521× the starting value

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

First steps1,465,434 → 732,717 → 2,198,152 → 1,099,076 → 549,538 → 274,769 → 824,308 → 412,154 → 206,077 → 618,232 → …

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

As a percentage & fraction

As a percentage146,543,400%

1,465,434% as a decimal14,654.34

1,465,434% of 1001,465,434

1,465,434% of 1,00014,654,340

As a fraction of 1001,465,434/100

Read another way

As seconds16 days, 23 hours and 3 minutes

As bytes1.398 MiB

As a 24-bit colour#165C5A

Keep nerding

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