Recognised as Number
7,067,713
- Positive
- Odd
- Prime
- 7 digits
7,067,713 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value7,067,713
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 numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation7,067,713
Distinct prime factors17,067,713
Number of divisors2
Sum of divisors σ(n)7,067,714
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)7,067,712integers below n that share no factor with it
Carmichael function λ(n)7,067,712the 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,067,7132 in total
Arithmetic
Previous number7,067,712
Next number7,067,714
Double14,135,426
Half3,533,856.5
Square49,952,567,050,369
Cube353,050,407,525,264,636,097
Square root2,658.517067841≈irrational, shown to 9 decimal places
Cube root191.90795103≈
Negation-7,067,713
Reciprocal1.41488484 × 10^-7≈
Representations
Decimal7,067,713
Binary1101011110110000100000123 bits
Octal32754101
Hexadecimal6BD841
Base 3647HHD
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsseven million, sixty-seven thousand, seven hundred and thirteen
Ordinalseven million, sixty-seven thousand, seven hundred and thirteenth
Scientific notation7.067713 × 10^6
Engineering notation7.067713 × 10^6
In other bases
Ternary111022002002011base 3; the most digit-efficient integer base after e: 15 digits
Quinary3302131323base 5; one hand: 10 digits
Septenary114034402base 7: 9 digits
Nonary14262064base 9; each digit is two ternary digits: 8 digits
Duodecimal244a141base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal24395dbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal32:43:15:13base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary11110T01T01T011digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101111000010100001000001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000011010111101100001000001
Bit length23 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits12within that length
Bit parityodd11 set bits, so odd; 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 d8 41
Gray code10111100011010001100001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000011010111101100001000001
64-bit0000000000000000000000000000000000000000011010111101100001000001
One's complement11111111100101000010011110111110at 32 bits, every bit flipped
Bits reversed10000010000110111101011000000000at 32 bits
Rotated left by 100000000110101111011000010000010at 32 bits, wrapping
Shifted left by 1110101111011000010000010= 14,135,426, no wrap
Shifted right by 11101011110110000100000= 3,533,856, discarding the low bit
These bits as a double3.49191419 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
7,067,713 to the power 249,952,567,050,369
7,067,713 to the power 3353,050,407,525,264,636,097
7,067,713 to the power 42,495,258,954,921,610,696,983,036,161
7,067,713 to the power 517,635,774,154,065,881,904,006,065,454,569,793
First ten multiples7,067,713, 14,135,426, 21,203,139, 28,270,852, 35,338,565, 42,406,278, 49,473,991, 56,541,704, 63,609,417, 70,677,130
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 3
Divisible by 6No, remainder 1
Divisible by 7No, remainder 2
Divisible by 8No, remainder 1
Divisible by 9No, remainder 4
Divisible by 10No, remainder 3
Divisible by 11No, remainder 4
Divisible by 12No, remainder 1
Divisible by 100No, remainder 13
Collatz (3n + 1) trajectory
Steps to reach 1173the total stopping time
Highest value reached21,203,1403× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps7,067,713 → 21,203,140 → 10,601,570 → 5,300,785 → 15,902,356 → 7,951,178 → 3,975,589 → 11,926,768 → 5,963,384 → 2,981,692 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage706,771,300%
7,067,713% as a decimal70,677.13
7,067,713% of 1007,067,713
7,067,713% of 1,00070,677,130
As a fraction of 1007,067,713/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,067,713
Nerdulate something else
Nothing in mind? Surprise me · today’s page