Recognised as Number
6,901,371
- Positive
- Odd
- Composite
- 7 digits
6,901,371 is an odd 7-digit integer and a composite number. It has 24 divisors and a digital root of 9.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value6,901,371
Digit count7
Digit sum27
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3^2 × 17 × 43 × 1,049
Distinct prime factors43, 17, 43, 1,049
Number of divisors24
Sum of divisors σ(n)10,810,800
Aliquot sum3,909,429sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)4,225,536integers below n that share no factor with it
Carmichael function λ(n)44,016the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 4,225,536
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 3, 9, 17, 43, 51, 129, 153, 387, 731, 1,049, 2,193, 3,147, 6,579, 9,441, 17,833, 45,107, 53,499, 135,321, 160,497, 405,963, 766,819, 2,300,457, 6,901,37124 in total
Arithmetic
Previous number6,901,370
Next number6,901,372
Double13,802,742
Half3,450,685.5
Square47,628,921,679,641
Cube328,704,858,841,145,687,811
Square root2,627.046059741≈irrational, shown to 9 decimal places
Cube root190.390434443≈
Negation-6,901,371
Reciprocal1.44898745 × 10^-7≈
Representations
Decimal6,901,371
Binary1101001010011100111101123 bits
Octal32247173
Hexadecimal694E7B
Base 3643X4R
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordssix million, nine hundred and one thousand, three hundred and seventy-one
Ordinalsix million, nine hundred and one thousand, three hundred and seventy-first
Scientific notation6.901371 × 10^6
Engineering notation6.901371 × 10^6
In other bases
Ternary110222121220100base 3; the most digit-efficient integer base after e: 15 digits
Quinary3231320441base 5; one hand: 10 digits
Septenary112442421base 7: 9 digits
Nonary13877810base 9; each digit is two ternary digits: 8 digits
Duodecimal2389a23base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal232d8bbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal31:57:2:51base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary111000T0T0T0100digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101110010101001110001111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000011010010100111001111011
Bit length23 bitsto write the magnitude
Set bits14the population count, or Hamming weight
Zero bits9within that length
Bit parityeven14 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
Bytes369 4e 7b
Gray code10111011110100101000110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000011010010100111001111011
64-bit0000000000000000000000000000000000000000011010010100111001111011
One's complement11111111100101101011000110000100at 32 bits, every bit flipped
Bits reversed11011110011100101001011000000000at 32 bits
Rotated left by 100000000110100101001110011110110at 32 bits, wrapping
Shifted left by 1110100101001110011110110= 13,802,742, no wrap
Shifted right by 11101001010011100111101= 3,450,685, discarding the low bit
These bits as a double3.40973032 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
6,901,371 to the power 247,628,921,679,641
6,901,371 to the power 3328,704,858,841,145,687,811
6,901,371 to the power 42,268,514,180,365,376,456,633,888,881
6,901,371 to the power 515,655,857,977,462,378,481,895,878,340,555,851
First ten multiples6,901,371, 13,802,742, 20,704,113, 27,605,484, 34,506,855, 41,408,226, 48,309,597, 55,210,968, 62,112,339, 69,013,710
Powers of twoBetween 2^22 (4,194,304) and 2^23 (8,388,608)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 3
Divisible by 5No, remainder 1
Divisible by 6No, remainder 3
Divisible by 7No, remainder 1
Divisible by 8No, remainder 3
Divisible by 9Yes
Divisible by 10No, remainder 1
Divisible by 11No, remainder 4
Divisible by 12No, remainder 3
Divisible by 100No, remainder 71
Collatz (3n + 1) trajectory
Steps to reach 1209the total stopping time
Highest value reached34,938,1965× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps6,901,371 → 20,704,114 → 10,352,057 → 31,056,172 → 15,528,086 → 7,764,043 → 23,292,130 → 11,646,065 → 34,938,196 → 17,469,098 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage690,137,100%
6,901,371% as a decimal69,013.71
6,901,371% of 1006,901,371
6,901,371% of 1,00069,013,710
As a fraction of 1006,901,371/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 6,901,371
Nerdulate something else
Nothing in mind? Surprise me · today’s page