Recognised as Number

4,155,723

Positive
Odd
Composite
7 digits

4,155,723 is an odd 7-digit integer and a composite number. It has 24 divisors and a digital root of 9.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value4,155,723

Digit count7

Digit sum27

Digit product4,200

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

Digital root9repeated digit sum

PalindromicNoreads differently backwards

Happy numberYessquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3^2 × 11 × 13 × 3,229

Distinct prime factors43, 11, 13, 3,229

Number of divisors24

Sum of divisors σ(n)7,054,320

Aliquot sum2,898,597sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)2,324,160integers below n that share no factor with it

Carmichael function λ(n)16,140the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,324,160

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

SquarefreeNohas a repeated prime factor

All divisors1, 3, 9, 11, 13, 33, 39, 99, 117, 143, 429, 1,287, 3,229, 9,687, 29,061, 35,519, 41,977, 106,557, 125,931, 319,671, 377,793, 461,747, 1,385,241, 4,155,72324 in total

Arithmetic

Previous number4,155,722

Next number4,155,724

Double8,311,446

Half2,077,861.5

Square17,270,033,652,729

Cube71,769,476,061,419,918,067

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

Cube root160.773893995≈

Negation-4,155,723

Reciprocal2.40632015 × 10^-7≈

Representations

Decimal4,155,723

Binary111111011010010100101122 bits

Octal17664513

Hexadecimal3F694B

Base 362H2KR

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

In wordsfour million, one hundred and fifty-five thousand, seven hundred and twenty-three

Ordinalfour million, one hundred and fifty-five thousand, seven hundred and twenty-third

Scientific notation4.155723 × 10^6

Engineering notation4.155723 × 10^6

In other bases

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

Quinary2030440343base 5; one hand: 10 digits

Septenary50215545base 7: 8 digits

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

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

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

Sexagesimal19:14:22:3base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000001111110110100101001011

Bit length22 bitsto write the magnitude

Set bits14the population count, or Hamming weight

Zero bits8within that length

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

Highest set bitbit 21worth 2,097,152

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes33f 69 4b

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

At each machine width

32-bit00000000001111110110100101001011

64-bit0000000000000000000000000000000000000000001111110110100101001011

One's complement11111111110000001001011010110100at 32 bits, every bit flipped

Bits reversed11010010100101101111110000000000at 32 bits

Rotated left by 100000000011111101101001010010110at 32 bits, wrapping

Shifted left by 111111101101001010010110= 8,311,446, no wrap

Shifted right by 1111111011010010100101= 2,077,861, discarding the low bit

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

Nearest landmarks

Next prime4,155,731+8

Previous prime4,155,721−2

Distance to nearest prime2

Nearest square below4,153,444

Nearest square above4,157,521

Powers & multiples

4,155,723 to the power 217,270,033,652,729

4,155,723 to the power 371,769,476,061,419,918,067

4,155,723 to the power 4298,254,062,366,392,166,169,147,441

4,155,723 to the power 51,239,461,266,819,450,351,968,947,910,954,843

First ten multiples4,155,723, 8,311,446, 12,467,169, 16,622,892, 20,778,615, 24,934,338, 29,090,061, 33,245,784, 37,401,507, 41,557,230

Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3Yes

Divisible by 4No, remainder 3

Divisible by 5No, remainder 3

Divisible by 6No, remainder 3

Divisible by 7No, remainder 5

Divisible by 8No, remainder 3

Divisible by 9Yes

Divisible by 10No, remainder 3

Divisible by 11Yes

Divisible by 12No, remainder 3

Divisible by 100No, remainder 23

Collatz (3n + 1) trajectory

Steps to reach 1229the total stopping time

Highest value reached18,700,7564× the starting value

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

First steps4,155,723 → 12,467,170 → 6,233,585 → 18,700,756 → 9,350,378 → 4,675,189 → 14,025,568 → 7,012,784 → 3,506,392 → 1,753,196 → …

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

As a percentage & fraction

As a percentage415,572,300%

4,155,723% as a decimal41,557.23

4,155,723% of 1004,155,723

4,155,723% of 1,00041,557,230

As a fraction of 1004,155,723/100

Read another way

As seconds48 days, 2 hours and 22 minutes

As bytes3.963 MiB

As a 24-bit colour#3F694B

Keep nerding

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