Recognised as Number
6,231,371
- Positive
- Odd
- Prime
- 7 digits
6,231,371 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 5.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value6,231,371
Digit count7
Digit sum23
Digit product756
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation6,231,371
Distinct prime factors16,231,371
Number of divisors2
Sum of divisors σ(n)6,231,372
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)6,231,370integers below n that share no factor with it
Carmichael function λ(n)6,231,370the 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, 6,231,3712 in total
Arithmetic
Previous number6,231,370
Next number6,231,372
Double12,462,742
Half3,115,685.5
Square38,829,984,539,641
Cube241,964,039,590,767,277,811
Square root2,496.271419538≈irrational, shown to 9 decimal places
Cube root184.018379938≈
Negation-6,231,371
Reciprocal1.60478328 × 10^-7≈
Representations
Decimal6,231,371
Binary1011111000101010100101123 bits
Octal27612513
Hexadecimal5F154B
Base 363PK5N
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordssix million, two hundred and thirty-one thousand, three hundred and seventy-one
Ordinalsix million, two hundred and thirty-one thousand, three hundred and seventy-first
Scientific notation6.231371 × 10^6
Engineering notation6.231371 × 10^6
In other bases
Ternary102201120211112base 3; the most digit-efficient integer base after e: 15 digits
Quinary3043400441base 5; one hand: 10 digits
Septenary103652156base 7: 9 digits
Nonary12646745base 9; each digit is two ternary digits: 8 digits
Duodecimal210614bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal1iii8bbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal28:50:56:11base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary110T1TTT10TTTTTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101000110001010101011111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000010111110001010101001011
Bit length23 bitsto write the magnitude
Set bits13the population count, or Hamming weight
Zero bits10within that length
Bit parityodd13 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
Bytes35f 15 4b
Gray code11100001001111111101110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000010111110001010101001011
64-bit0000000000000000000000000000000000000000010111110001010101001011
One's complement11111111101000001110101010110100at 32 bits, every bit flipped
Bits reversed11010010101010001111101000000000at 32 bits
Rotated left by 100000000101111100010101010010110at 32 bits, wrapping
Shifted left by 1101111100010101010010110= 12,462,742, no wrap
Shifted right by 11011111000101010100101= 3,115,685, discarding the low bit
These bits as a double3.07870634 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
6,231,371 to the power 238,829,984,539,641
6,231,371 to the power 3241,964,039,590,767,277,811
6,231,371 to the power 41,507,767,699,348,759,082,700,408,881
6,231,371 to the power 59,395,459,916,458,576,233,925,929,589,205,851
First ten multiples6,231,371, 12,462,742, 18,694,113, 24,925,484, 31,156,855, 37,388,226, 43,619,597, 49,850,968, 56,082,339, 62,313,710
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 2
Divisible by 4No, remainder 3
Divisible by 5No, remainder 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 6
Divisible by 8No, remainder 3
Divisible by 9No, remainder 5
Divisible by 10No, remainder 1
Divisible by 11No, remainder 3
Divisible by 12No, remainder 11
Divisible by 100No, remainder 71
Collatz (3n + 1) trajectory
Steps to reach 1183the total stopping time
Highest value reached28,041,1724× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps6,231,371 → 18,694,114 → 9,347,057 → 28,041,172 → 14,020,586 → 7,010,293 → 21,030,880 → 10,515,440 → 5,257,720 → 2,628,860 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage623,137,100%
6,231,371% as a decimal62,313.71
6,231,371% of 1006,231,371
6,231,371% of 1,00062,313,710
As a fraction of 1006,231,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,231,371
Nerdulate something else
Nothing in mind? Surprise me · today’s page