Recognised as Number

4,658,701

Positive
Odd
Prime
7 digits

4,658,701 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 value4,658,701

Digit count7

Digit sum31

Digit product0zero, because one of the digits is zero

Multiplicative persistence1times 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 factorisation4,658,701

Distinct prime factors14,658,701

Number of divisors2

Sum of divisors σ(n)4,658,702

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)4,658,700the 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, 4,658,7012 in total

Arithmetic

Previous number4,658,700

Next number4,658,702

Double9,317,402

Half2,329,350.5

Square21,703,495,007,401

Cube101,110,093,894,474,046,101

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

Cube root167.014795443≈

Negation-4,658,701

Reciprocal2.1465211 × 10^-7≈

Representations

Decimal4,658,701

Binary1000111000101100000110123 bits

Octal21613015

Hexadecimal47160D

Base 362RUOD

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

In wordsfour million, six hundred and fifty-eight thousand, seven hundred and one

Ordinalfour million, six hundred and fifty-eight thousand, seven hundred and first

Scientific notation4.658701 × 10^6

Engineering notation4.658701 × 10^6

In other bases

Ternary22202200112111base 3; the most digit-efficient integer base after e: 14 digits

Quinary2143034301base 5; one hand: 10 digits

Septenary54412135base 7: 8 digits

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

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

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

Sexagesimal21:34:5:1base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000010001110001011000001101

Bit length23 bitsto write the magnitude

Set bits10the population count, or Hamming weight

Zero bits13within that length

Bit parityeven10 set bits, so even; 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

Bytes347 16 0d

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

At each machine width

32-bit00000000010001110001011000001101

64-bit0000000000000000000000000000000000000000010001110001011000001101

One's complement11111111101110001110100111110010at 32 bits, every bit flipped

Bits reversed10110000011010001110001000000000at 32 bits

Rotated left by 100000000100011100010110000011010at 32 bits, wrapping

Shifted left by 1100011100010110000011010= 9,317,402, no wrap

Shifted right by 11000111000101100000110= 2,329,350, discarding the low bit

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

Nearest landmarks

Next prime4,658,713+12

Previous prime4,658,677−24

Distance to nearest prime0, it is prime

Nearest square below4,656,964

Nearest square above4,661,281

Powers & multiples

4,658,701 to the power 221,703,495,007,401

4,658,701 to the power 3101,110,093,894,474,046,101

4,658,701 to the power 4471,041,695,536,280,133,044,774,801

4,658,701 to the power 52,194,442,418,036,563,792,095,825,410,193,501

First ten multiples4,658,701, 9,317,402, 13,976,103, 18,634,804, 23,293,505, 27,952,206, 32,610,907, 37,269,608, 41,928,309, 46,587,010

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 1

Divisible by 6No, remainder 1

Divisible by 7No, remainder 5

Divisible by 8No, remainder 5

Divisible by 9No, remainder 4

Divisible by 10No, remainder 1

Divisible by 11No, remainder 3

Divisible by 12No, remainder 1

Divisible by 100No, remainder 1

Collatz (3n + 1) trajectory

Steps to reach 1149the total stopping time

Highest value reached13,976,1043× the starting value

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

First steps4,658,701 → 13,976,104 → 6,988,052 → 3,494,026 → 1,747,013 → 5,241,040 → 2,620,520 → 1,310,260 → 655,130 → 327,565 → …

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

As a percentage & fraction

As a percentage465,870,100%

4,658,701% as a decimal46,587.01

4,658,701% of 1004,658,701

4,658,701% of 1,00046,587,010

As a fraction of 1004,658,701/100

Read another way

As seconds53 days, 22 hours and 5 minutes

As bytes4.443 MiB

As a 24-bit colour#47160D

Keep nerding

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