Recognised as Number
3,067,747
- Positive
- Odd
- Prime
- 7 digits
3,067,747 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value3,067,747
Digit count7
Digit sum34
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 numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3,067,747
Distinct prime factors13,067,747
Number of divisors2
Sum of divisors σ(n)3,067,748
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,067,746integers below n that share no factor with it
Carmichael function λ(n)3,067,746the 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, 3,067,7472 in total
Arithmetic
Previous number3,067,746
Next number3,067,748
Double6,135,494
Half1,533,873.5
Square9,411,071,656,009
Cube28,870,786,839,506,641,723
Square root1,751.498501284≈irrational, shown to 9 decimal places
Cube root145.302531254≈
Negation-3,067,747
Reciprocal3.25972122 × 10^-7≈
Representations
Decimal3,067,747
Binary101110110011110110001122 bits
Octal13547543
Hexadecimal2ECF63
Base 361TR37
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, sixty-seven thousand, seven hundred and forty-seven
Ordinalthree million, sixty-seven thousand, seven hundred and forty-seventh
Scientific notation3.067747 × 10^6
Engineering notation3.067747 × 10^6
In other bases
Ternary12202212011021base 3; the most digit-efficient integer base after e: 14 digits
Quinary1241131442base 5; one hand: 10 digits
Septenary35034604base 7: 8 digits
Nonary5685137base 9; each digit is two ternary digits: 7 digits
Duodecimal103b397base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimalj3977base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal14:12:9:7base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T0T100TT0111T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11100111101000010100111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001011101100111101100011
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
Bytes32e cf 63
Gray code1110011010100011010010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001011101100111101100011
64-bit0000000000000000000000000000000000000000001011101100111101100011
One's complement11111111110100010011000010011100at 32 bits, every bit flipped
Bits reversed11000110111100110111010000000000at 32 bits
Rotated left by 100000000010111011001111011000110at 32 bits, wrapping
Shifted left by 110111011001111011000110= 6,135,494, no wrap
Shifted right by 1101110110011110110001= 1,533,873, discarding the low bit
These bits as a double1.5156684 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,067,747 to the power 29,411,071,656,009
3,067,747 to the power 328,870,786,839,506,641,723
3,067,747 to the power 488,568,269,714,535,981,625,808,081
3,067,747 to the power 5271,705,043,711,958,614,024,627,863,063,507
First ten multiples3,067,747, 6,135,494, 9,203,241, 12,270,988, 15,338,735, 18,406,482, 21,474,229, 24,541,976, 27,609,723, 30,677,470
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 2
Divisible by 6No, remainder 1
Divisible by 7No, remainder 4
Divisible by 8No, remainder 3
Divisible by 9No, remainder 7
Divisible by 10No, remainder 7
Divisible by 11No, remainder 1
Divisible by 12No, remainder 7
Divisible by 100No, remainder 47
Collatz (3n + 1) trajectory
Steps to reach 1102the total stopping time
Highest value reached13,804,8644× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,067,747 → 9,203,242 → 4,601,621 → 13,804,864 → 6,902,432 → 3,451,216 → 1,725,608 → 862,804 → 431,402 → 215,701 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage306,774,700%
3,067,747% as a decimal30,677.47
3,067,747% of 1003,067,747
3,067,747% of 1,00030,677,470
As a fraction of 1003,067,747/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,067,747
Nerdulate something else
Nothing in mind? Surprise me · today’s page