Recognised as Number
6,367,331
- Positive
- Odd
- Prime
- 7 digits
6,367,331 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 2.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value6,367,331
Digit count7
Digit sum29
Digit product6,804
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation6,367,331
Distinct prime factors16,367,331
Number of divisors2
Sum of divisors σ(n)6,367,332
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)6,367,330integers below n that share no factor with it
Carmichael function λ(n)6,367,330the 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,367,3312 in total
Arithmetic
Previous number6,367,330
Next number6,367,332
Double12,734,662
Half3,183,665.5
Square40,542,904,063,561
Cube258,150,089,873,937,925,691
Square root2,523.357089276≈irrational, shown to 9 decimal places
Cube root185.347105823≈
Negation-6,367,331
Reciprocal1.57051675 × 10^-7≈
Representations
Decimal6,367,331
Binary1100001001010000110001123 bits
Octal30224143
Hexadecimal612863
Base 363SH2B
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordssix million, three hundred and sixty-seven thousand, three hundred and thirty-one
Ordinalsix million, three hundred and sixty-seven thousand, three hundred and thirty-first
Scientific notation6.367331 × 10^6
Engineering notation6.367331 × 10^6
In other bases
Ternary102222111100002base 3; the most digit-efficient integer base after e: 15 digits
Quinary3112223311base 5; one hand: 10 digits
Septenary105056435base 7: 9 digits
Nonary12874302base 9; each digit is two ternary digits: 8 digits
Duodecimal217096bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal1jfi6bbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal29:28:42:11base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary11000T11110001Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101000010111100110100111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000011000010010100001100011
Bit length23 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits14within that length
Bit parityodd9 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
Bytes361 28 63
Gray code10100011011110001010010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000011000010010100001100011
64-bit0000000000000000000000000000000000000000011000010010100001100011
One's complement11111111100111101101011110011100at 32 bits, every bit flipped
Bits reversed11000110000101001000011000000000at 32 bits
Rotated left by 100000000110000100101000011000110at 32 bits, wrapping
Shifted left by 1110000100101000011000110= 12,734,662, no wrap
Shifted right by 11100001001010000110001= 3,183,665, discarding the low bit
These bits as a double3.1458795 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
6,367,331 to the power 240,542,904,063,561
6,367,331 to the power 3258,150,089,873,937,925,691
6,367,331 to the power 41,643,727,069,907,111,046,328,000,721
6,367,331 to the power 510,466,154,327,758,715,285,726,715,158,845,651
First ten multiples6,367,331, 12,734,662, 19,101,993, 25,469,324, 31,836,655, 38,203,986, 44,571,317, 50,938,648, 57,305,979, 63,673,310
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 5
Divisible by 8No, remainder 3
Divisible by 9No, remainder 2
Divisible by 10No, remainder 1
Divisible by 11No, remainder 3
Divisible by 12No, remainder 11
Divisible by 100No, remainder 31
Collatz (3n + 1) trajectory
Steps to reach 1196the total stopping time
Highest value reached28,652,9924× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps6,367,331 → 19,101,994 → 9,550,997 → 28,652,992 → 14,326,496 → 7,163,248 → 3,581,624 → 1,790,812 → 895,406 → 447,703 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage636,733,100%
6,367,331% as a decimal63,673.31
6,367,331% of 1006,367,331
6,367,331% of 1,00063,673,310
As a fraction of 1006,367,331/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,367,331
Nerdulate something else
Nothing in mind? Surprise me · today’s page