Recognised as Number

4,015,559

Positive
Odd
Prime
7 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value4,015,559

Digit count7

Digit sum29

Digit product0zero, because one of the digits is zero

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

Digital root2repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation4,015,559

Distinct prime factors14,015,559

Number of divisors2

Sum of divisors σ(n)4,015,560

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)4,015,558the 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,015,5592 in total

Arithmetic

Previous number4,015,558

Next number4,015,560

Double8,031,118

Half2,007,779.5

Square16,124,714,082,481

Cube64,749,740,756,333,321,879

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

Cube root158.945658684≈

Negation-4,015,559

Reciprocal2.4903133 × 10^-7≈

Representations

Decimal4,015,559

Binary111101010001011100011122 bits

Octal17242707

Hexadecimal3D45C7

Base 362E2FB

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

In wordsfour million, fifteen thousand, five hundred and fifty-nine

Ordinalfour million, fifteen thousand, five hundred and fifty-ninth

Scientific notation4.015559 × 10^6

Engineering notation4.015559 × 10^6

In other bases

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

Quinary2011444214base 5; one hand: 10 digits

Septenary46063112base 7: 8 digits

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

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

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

Sexagesimal18:35:25:59base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000001111010100010111000111

Bit length22 bitsto write the magnitude

Set bits13the population count, or Hamming weight

Zero bits9within that length

Bit parityodd13 set bits, so odd; 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

Bytes33d 45 c7

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

At each machine width

32-bit00000000001111010100010111000111

64-bit0000000000000000000000000000000000000000001111010100010111000111

One's complement11111111110000101011101000111000at 32 bits, every bit flipped

Bits reversed11100011101000101011110000000000at 32 bits

Rotated left by 100000000011110101000101110001110at 32 bits, wrapping

Shifted left by 111110101000101110001110= 8,031,118, no wrap

Shifted right by 1111101010001011100011= 2,007,779, discarding the low bit

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

Nearest landmarks

Next prime4,015,567+8

Previous prime4,015,549−10

Distance to nearest prime0, it is prime

Nearest square below4,012,009

Nearest square above4,016,016

Powers & multiples

4,015,559 to the power 216,124,714,082,481

4,015,559 to the power 364,749,740,756,333,321,879

4,015,559 to the power 4260,006,404,241,761,077,671,115,361

4,015,559 to the power 51,044,071,056,610,641,871,291,946,327,901,799

First ten multiples4,015,559, 8,031,118, 12,046,677, 16,062,236, 20,077,795, 24,093,354, 28,108,913, 32,124,472, 36,140,031, 40,155,590

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

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 2

Divisible by 4No, remainder 3

Divisible by 5No, remainder 4

Divisible by 6No, remainder 5

Divisible by 7No, remainder 2

Divisible by 8No, remainder 7

Divisible by 9No, remainder 2

Divisible by 10No, remainder 9

Divisible by 11No, remainder 9

Divisible by 12No, remainder 11

Divisible by 100No, remainder 59

Collatz (3n + 1) trajectory

Steps to reach 1167the total stopping time

Highest value reached27,105,0286× the starting value

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

First steps4,015,559 → 12,046,678 → 6,023,339 → 18,070,018 → 9,035,009 → 27,105,028 → 13,552,514 → 6,776,257 → 20,328,772 → 10,164,386 → …

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

As a percentage & fraction

As a percentage401,555,900%

4,015,559% as a decimal40,155.59

4,015,559% of 1004,015,559

4,015,559% of 1,00040,155,590

As a fraction of 1004,015,559/100

Read another way

As seconds46 days, 11 hours and 25 minutes

As bytes3.83 MiB

As a 24-bit colour#3D45C7

Keep nerding

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