Recognised as Number
3,013,945
- Positive
- Odd
- Composite
- 7 digits
3,013,945 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 value3,013,945
Digit count7
Digit sum25
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times 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 factorisation5 × 11 × 54,799
Distinct prime factors35, 11, 54,799
Number of divisors8
Sum of divisors σ(n)3,945,600
Aliquot sum931,655sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,191,920integers below n that share no factor with it
Carmichael function λ(n)547,980the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,191,920
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 5, 11, 55, 54,799, 273,995, 602,789, 3,013,9458 in total
Arithmetic
Previous number3,013,944
Next number3,013,946
Double6,027,890
Half1,506,972.5
Square9,083,864,463,025
Cube27,378,267,879,011,883,625
Square root1,736.071715109≈irrational, shown to 9 decimal places
Cube root144.448080228≈
Negation-3,013,945
Reciprocal3.31791058 × 10^-7≈
Representations
Decimal3,013,945
Binary101101111111010011100122 bits
Octal13376471
Hexadecimal2DFD39
Base 361SLKP
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, thirteen thousand, nine hundred and forty-five
Ordinalthree million, thirteen thousand, nine hundred and forty-fifth
Scientific notation3.013945 × 10^6
Engineering notation3.013945 × 10^6
In other bases
Ternary12200010100121base 3; the most digit-efficient integer base after e: 14 digits
Quinary1232421240base 5; one hand: 10 digits
Septenary34422004base 7: 8 digits
Nonary5603317base 9; each digit is two ternary digits: 7 digits
Duodecimal1014221base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimaligeh5base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal13:57:12:25base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T0T00010101TT1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11100100000110101001001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001011011111110100111001
Bit length22 bitsto write the magnitude
Set bits15the population count, or Hamming weight
Zero bits7within that length
Bit parityodd15 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
Bytes32d fd 39
Gray code1110110000001110100101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001011011111110100111001
64-bit0000000000000000000000000000000000000000001011011111110100111001
One's complement11111111110100100000001011000110at 32 bits, every bit flipped
Bits reversed10011100101111111011010000000000at 32 bits
Rotated left by 100000000010110111111101001110010at 32 bits, wrapping
Shifted left by 110110111111101001110010= 6,027,890, no wrap
Shifted right by 1101101111111010011100= 1,506,972, discarding the low bit
These bits as a double1.48908668 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,013,945 to the power 29,083,864,463,025
3,013,945 to the power 327,378,267,879,011,883,625
3,013,945 to the power 482,516,593,582,608,471,592,150,625
3,013,945 to the power 5248,700,474,645,334,889,912,804,415,465,625
First ten multiples3,013,945, 6,027,890, 9,041,835, 12,055,780, 15,069,725, 18,083,670, 21,097,615, 24,111,560, 27,125,505, 30,139,450
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 1
Divisible by 5Yes
Divisible by 6No, remainder 1
Divisible by 7No, remainder 4
Divisible by 8No, remainder 1
Divisible by 9No, remainder 7
Divisible by 10No, remainder 5
Divisible by 11Yes
Divisible by 12No, remainder 1
Divisible by 100No, remainder 45
Collatz (3n + 1) trajectory
Steps to reach 1257the total stopping time
Highest value reached62,710,03620× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,013,945 → 9,041,836 → 4,520,918 → 2,260,459 → 6,781,378 → 3,390,689 → 10,172,068 → 5,086,034 → 2,543,017 → 7,629,052 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage301,394,500%
3,013,945% as a decimal30,139.45
3,013,945% of 1003,013,945
3,013,945% of 1,00030,139,450
As a fraction of 1003,013,945/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,013,945
Nerdulate something else
Nothing in mind? Surprise me · today’s page