Recognised as Number
3,026,479
- Positive
- Odd
- Composite
- 7 digits
3,026,479 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,026,479
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 factorisation113 × 26,783
Distinct prime factors2113, 26,783
Number of divisors4
Sum of divisors σ(n)3,053,376
Aliquot sum26,897sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,999,584integers below n that share no factor with it
Carmichael function λ(n)214,256the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,999,584
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 113, 26,783, 3,026,4794 in total
Arithmetic
Previous number3,026,478
Next number3,026,480
Double6,052,958
Half1,513,239.5
Square9,159,575,137,441
Cube27,721,261,802,387,300,239
Square root1,739.67784374≈irrational, shown to 9 decimal places
Cube root144.648040551≈
Negation-3,026,479
Reciprocal3.30416963 × 10^-7≈
Representations
Decimal3,026,479
Binary101110001011100010111122 bits
Octal13427057
Hexadecimal2E2E2F
Base 361SV8V
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, twenty-six thousand, four hundred and seventy-nine
Ordinalthree million, twenty-six thousand, four hundred and seventy-ninth
Scientific notation3.026479 × 10^6
Engineering notation3.026479 × 10^6
In other bases
Ternary12200202112211base 3; the most digit-efficient integer base after e: 14 digits
Quinary1233321404base 5; one hand: 10 digits
Septenary34503361base 7: 8 digits
Nonary5622484base 9; each digit is two ternary digits: 7 digits
Duodecimal101b527base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimalii63jbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal14:0:41:19base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T0T01T10TT0T11digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11100100111001001110011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001011100010111000101111
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
Bytes32e 2e 2f
Gray code1110010011100100111000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001011100010111000101111
64-bit0000000000000000000000000000000000000000001011100010111000101111
One's complement11111111110100011101000111010000at 32 bits, every bit flipped
Bits reversed11110100011101000111010000000000at 32 bits
Rotated left by 100000000010111000101110001011110at 32 bits, wrapping
Shifted left by 110111000101110001011110= 6,052,958, no wrap
Shifted right by 1101110001011100010111= 1,513,239, discarding the low bit
These bits as a double1.4952793 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,026,479 to the power 29,159,575,137,441
3,026,479 to the power 327,721,261,802,387,300,239
3,026,479 to the power 483,897,816,698,427,314,040,028,481
3,026,479 to the power 5253,914,980,383,639,598,968,551,357,148,399
First ten multiples3,026,479, 6,052,958, 9,079,437, 12,105,916, 15,132,395, 18,158,874, 21,185,353, 24,211,832, 27,238,311, 30,264,790
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 1
Divisible by 4No, remainder 3
Divisible by 5No, remainder 4
Divisible by 6No, remainder 1
Divisible by 7No, remainder 1
Divisible by 8No, remainder 7
Divisible by 9No, remainder 4
Divisible by 10No, remainder 9
Divisible by 11No, remainder 5
Divisible by 12No, remainder 7
Divisible by 100No, remainder 79
Collatz (3n + 1) trajectory
Steps to reach 1257the total stopping time
Highest value reached58,174,03619× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,026,479 → 9,079,438 → 4,539,719 → 13,619,158 → 6,809,579 → 20,428,738 → 10,214,369 → 30,643,108 → 15,321,554 → 7,660,777 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage302,647,900%
3,026,479% as a decimal30,264.79
3,026,479% of 1003,026,479
3,026,479% of 1,00030,264,790
As a fraction of 1003,026,479/100
Read another way
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from 3,026,479
Nerdulate something else
Nothing in mind? Surprise me · today’s page