Recognised as Number
7,064,089
- Positive
- Odd
- Prime
- 7 digits
7,064,089 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 value7,064,089
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 numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation7,064,089
Distinct prime factors17,064,089
Number of divisors2
Sum of divisors σ(n)7,064,090
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)7,064,088integers below n that share no factor with it
Carmichael function λ(n)7,064,088the 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, 7,064,0892 in total
Arithmetic
Previous number7,064,088
Next number7,064,090
Double14,128,178
Half3,532,044.5
Square49,901,353,399,921
Cube352,507,601,637,494,536,969
Square root2,657.835397462≈irrational, shown to 9 decimal places
Cube root191.875144882≈
Negation-7,064,089
Reciprocal1.4156107 × 10^-7≈
Representations
Decimal7,064,089
Binary1101011110010100001100123 bits
Octal32745031
Hexadecimal6BCA19
Base 3647EOP
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsseven million, sixty-four thousand and eighty-nine
Ordinalseven million, sixty-four thousand and eighty-ninth
Scientific notation7.064089 × 10^6
Engineering notation7.064089 × 10^6
In other bases
Ternary111021220002221base 3; the most digit-efficient integer base after e: 15 digits
Quinary3302022324base 5; one hand: 10 digits
Septenary114021004base 7: 9 digits
Nonary14256087base 9; each digit is two ternary digits: 8 digits
Duodecimal2448021base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal243049base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal32:42:14:49base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary11110T0T00100T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101111001101111001101001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000011010111100101000011001
Bit length23 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits11within that length
Bit parityeven12 set bits, so even; not the same as the number itself being odd
Highest set bitbit 22worth 4,194,304
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes36b ca 19
Gray code10111100010111100010101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000011010111100101000011001
64-bit0000000000000000000000000000000000000000011010111100101000011001
One's complement11111111100101000011010111100110at 32 bits, every bit flipped
Bits reversed10011000010100111101011000000000at 32 bits
Rotated left by 100000000110101111001010000110010at 32 bits, wrapping
Shifted left by 1110101111001010000110010= 14,128,178, no wrap
Shifted right by 11101011110010100001100= 3,532,044, discarding the low bit
These bits as a double3.49012369 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
7,064,089 to the power 249,901,353,399,921
7,064,089 to the power 3352,507,601,637,494,536,969
7,064,089 to the power 42,490,145,071,143,807,146,162,806,241
7,064,089 to the power 517,590,606,405,471,185,479,330,071,776,179,449
First ten multiples7,064,089, 14,128,178, 21,192,267, 28,256,356, 35,320,445, 42,384,534, 49,448,623, 56,512,712, 63,576,801, 70,640,890
Powers of twoBetween 2^22 (4,194,304) and 2^23 (8,388,608)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 1
Divisible by 5No, remainder 4
Divisible by 6No, remainder 1
Divisible by 7No, remainder 4
Divisible by 8No, remainder 1
Divisible by 9No, remainder 7
Divisible by 10No, remainder 9
Divisible by 11No, remainder 10
Divisible by 12No, remainder 1
Divisible by 100No, remainder 89
Collatz (3n + 1) trajectory
Steps to reach 198the total stopping time
Highest value reached23,841,3043× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps7,064,089 → 21,192,268 → 10,596,134 → 5,298,067 → 15,894,202 → 7,947,101 → 23,841,304 → 11,920,652 → 5,960,326 → 2,980,163 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage706,408,900%
7,064,089% as a decimal70,640.89
7,064,089% of 1007,064,089
7,064,089% of 1,00070,640,890
As a fraction of 1007,064,089/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 7,064,089
Nerdulate something else
Nothing in mind? Surprise me · today’s page