Recognised as Number

1,464,241

Positive
Odd
Prime
7 digits

1,464,241 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 4.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value1,464,241

Digit count7

Digit sum22

Digit product768

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

Digital root4repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation1,464,241

Distinct prime factors11,464,241

Number of divisors2

Sum of divisors σ(n)1,464,242

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)1,464,240the smallest exponent with aˣ ≡ 1 for every unit coprime to n

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

SquarefreeYesno repeated prime factor

All divisors1, 1,464,2412 in total

Arithmetic

Previous number1,464,240

Next number1,464,242

Double2,928,482

Half732,120.5

Square2,144,001,706,081

Cube3,139,335,202,113,749,521

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

Cube root113.55445775≈

Negation-1,464,241

Reciprocal6.82947684 × 10^-7≈

Representations

Decimal1,464,241

Binary10110010101111011000121 bits

Octal5453661

Hexadecimal1657B1

Base 36VDTD

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

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

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

Scientific notation1.464241 × 10^6

Engineering notation1.464241 × 10^6

In other bases

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

Quinary333323431base 5; one hand: 9 digits

Septenary15305632base 7: 8 digits

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

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

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

Sexagesimal6:46:44:1base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000000101100101011110110001

Bit length21 bitsto write the magnitude

Set bits12the population count, or Hamming weight

Zero bits9within that length

Bit parityeven12 set bits, so even; 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 57 b1

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

At each machine width

32-bit00000000000101100101011110110001

64-bit0000000000000000000000000000000000000000000101100101011110110001

One's complement11111111111010011010100001001110at 32 bits, every bit flipped

Bits reversed10001101111010100110100000000000at 32 bits

Rotated left by 100000000001011001010111101100010at 32 bits, wrapping

Shifted left by 11011001010111101100010= 2,928,482, no wrap

Shifted right by 110110010101111011000= 732,120, discarding the low bit

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

Nearest landmarks

Next prime1,464,251+10

Previous prime1,464,179−62

Distance to nearest prime0, it is prime

Nearest square below1,464,100

Nearest square above1,466,521

Powers & multiples

1,464,241 to the power 22,144,001,706,081

1,464,241 to the power 33,139,335,202,113,749,521

1,464,241 to the power 44,596,743,315,678,238,712,378,561

1,464,241 to the power 56,730,740,029,292,019,930,451,896,537,201

First ten multiples1,464,241, 2,928,482, 4,392,723, 5,856,964, 7,321,205, 8,785,446, 10,249,687, 11,713,928, 13,178,169, 14,642,410

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 2

Divisible by 8No, remainder 1

Divisible by 9No, remainder 4

Divisible by 10No, remainder 1

Divisible by 11No, remainder 9

Divisible by 12No, remainder 1

Divisible by 100No, remainder 41

Collatz (3n + 1) trajectory

Steps to reach 188the total stopping time

Highest value reached4,392,7243× the starting value

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

First steps1,464,241 → 4,392,724 → 2,196,362 → 1,098,181 → 3,294,544 → 1,647,272 → 823,636 → 411,818 → 205,909 → 617,728 → …

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

As a percentage & fraction

As a percentage146,424,100%

1,464,241% as a decimal14,642.41

1,464,241% of 1001,464,241

1,464,241% of 1,00014,642,410

As a fraction of 1001,464,241/100

Read another way

As seconds16 days, 22 hours and 44 minutes

As bytes1.396 MiB

As a 24-bit colour#1657B1

Keep nerding

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