Recognised as Number

4,964,497

Positive
Odd
Composite
7 digits

4,964,497 is an odd 7-digit integer and a composite number. It has 8 divisors and a digital root of 7.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value4,964,497

Digit count7

Digit sum43

Digit product217,728

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

Digital root7repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation103 × 157 × 307

Distinct prime factors3103, 157, 307

Number of divisors8

Sum of divisors σ(n)5,061,056

Aliquot sum96,559sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)4,869,072integers below n that share no factor with it

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

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

SquarefreeYesno repeated prime factor

All divisors1, 103, 157, 307, 16,171, 31,621, 48,199, 4,964,4978 in total

Arithmetic

Previous number4,964,496

Next number4,964,498

Double9,928,994

Half2,482,248.5

Square24,646,230,463,009

Cube122,356,137,194,916,791,473

Square root2,228.115122699≈irrational, shown to 9 decimal places

Cube root170.591904426≈

Negation-4,964,497

Reciprocal2.01430276 × 10^-7≈

Representations

Decimal4,964,497

Binary1001011110000001001000123 bits

Octal22740221

Hexadecimal4BC091

Base 362YEMP

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

In wordsfour million, nine hundred and sixty-four thousand, four hundred and ninety-seven

Ordinalfour million, nine hundred and sixty-four thousand, four hundred and ninety-seventh

Scientific notation4.964497 × 10^6

Engineering notation4.964497 × 10^6

In other bases

Ternary100100020000021base 3; the most digit-efficient integer base after e: 15 digits

Quinary2232330442base 5; one hand: 10 digits

Septenary60124516base 7: 8 digits

Nonary10306007base 9; each digit is two ternary digits: 8 digits

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

Vigesimal1b0b4hbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits

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

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

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

Bit-level

00000000010010111100000010010001

Bit length23 bitsto write the magnitude

Set bits9the population count, or Hamming weight

Zero bits14within that length

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

Highest set bitbit 22worth 4,194,304

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes34b c0 91

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

At each machine width

32-bit00000000010010111100000010010001

64-bit0000000000000000000000000000000000000000010010111100000010010001

One's complement11111111101101000011111101101110at 32 bits, every bit flipped

Bits reversed10001001000000111101001000000000at 32 bits

Rotated left by 100000000100101111000000100100010at 32 bits, wrapping

Shifted left by 1100101111000000100100010= 9,928,994, no wrap

Shifted right by 11001011110000001001000= 2,482,248, discarding the low bit

These bits as a double2.45278742 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime4,964,503+6

Previous prime4,964,489−8

Distance to nearest prime6

Nearest square below4,963,984

Nearest square above4,968,441

Powers & multiples

4,964,497 to the power 224,646,230,463,009

4,964,497 to the power 3122,356,137,194,916,791,473

4,964,497 to the power 4607,436,676,035,752,826,517,334,081

4,964,497 to the power 53,015,617,555,869,466,799,986,825,493,122,257

First ten multiples4,964,497, 9,928,994, 14,893,491, 19,857,988, 24,822,485, 29,786,982, 34,751,479, 39,715,976, 44,680,473, 49,644,970

Powers of twoBetween 2^22 (4,194,304) and 2^23 (8,388,608)

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 1

Divisible by 4No, remainder 1

Divisible by 5No, remainder 2

Divisible by 6No, remainder 1

Divisible by 7No, remainder 6

Divisible by 8No, remainder 1

Divisible by 9No, remainder 7

Divisible by 10No, remainder 7

Divisible by 11No, remainder 10

Divisible by 12No, remainder 1

Divisible by 100No, remainder 97

Collatz (3n + 1) trajectory

Steps to reach 1144the total stopping time

Highest value reached26,838,5925× the starting value

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

First steps4,964,497 → 14,893,492 → 7,446,746 → 3,723,373 → 11,170,120 → 5,585,060 → 2,792,530 → 1,396,265 → 4,188,796 → 2,094,398 → …

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

As a percentage & fraction

As a percentage496,449,700%

4,964,497% as a decimal49,644.97

4,964,497% of 1004,964,497

4,964,497% of 1,00049,644,970

As a fraction of 1004,964,497/100

Read another way

As seconds57 days, 11 hours and 1 minute

As bytes4.735 MiB

As a 24-bit colour#4BC091

Keep nerding

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