Recognised as Number
6,390,407
- Positive
- Odd
- Prime
- 7 digits
6,390,407 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,390,407
Digit count7
Digit sum29
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times 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,390,407
Distinct prime factors16,390,407
Number of divisors2
Sum of divisors σ(n)6,390,408
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)6,390,406integers below n that share no factor with it
Carmichael function λ(n)6,390,406the 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,390,4072 in total
Arithmetic
Previous number6,390,406
Next number6,390,408
Double12,780,814
Half3,195,203.5
Square40,837,301,625,649
Cube260,966,978,169,658,749,143
Square root2,527.925434027≈irrational, shown to 9 decimal places
Cube root185.570742871≈
Negation-6,390,407
Reciprocal1.56484556 × 10^-7≈
Representations
Decimal6,390,407
Binary1100001100000101000011123 bits
Octal30301207
Hexadecimal618287
Base 363SYVB
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordssix million, three hundred and ninety thousand, four hundred and seven
Ordinalsix million, three hundred and ninety thousand, four hundred and seventh
Scientific notation6.390407 × 10^6
Engineering notation6.390407 × 10^6
In other bases
Ternary110000122222202base 3; the most digit-efficient integer base after e: 15 digits
Quinary3113443112base 5; one hand: 10 digits
Septenary105213632base 7: 9 digits
Nonary13018882base 9; each digit is two ternary digits: 8 digits
Duodecimal218219bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal1jig07base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal29:35:6:47base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary110001T00000T1Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101001101000011110011011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000011000011000001010000111
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 82 87
Gray code10100010100001111000100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000011000011000001010000111
64-bit0000000000000000000000000000000000000000011000011000001010000111
One's complement11111111100111100111110101111000at 32 bits, every bit flipped
Bits reversed11100001010000011000011000000000at 32 bits
Rotated left by 100000000110000110000010100001110at 32 bits, wrapping
Shifted left by 1110000110000010100001110= 12,780,814, no wrap
Shifted right by 11100001100000101000011= 3,195,203, discarding the low bit
These bits as a double3.15728056 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
6,390,407 to the power 240,837,301,625,649
6,390,407 to the power 3260,966,978,169,658,749,143
6,390,407 to the power 41,667,685,204,064,234,458,134,671,201
6,390,407 to the power 510,657,187,201,848,512,330,905,009,785,568,807
First ten multiples6,390,407, 12,780,814, 19,171,221, 25,561,628, 31,952,035, 38,342,442, 44,732,849, 51,123,256, 57,513,663, 63,904,070
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 2
Divisible by 6No, remainder 5
Divisible by 7No, remainder 2
Divisible by 8No, remainder 7
Divisible by 9No, remainder 2
Divisible by 10No, remainder 7
Divisible by 11No, remainder 1
Divisible by 12No, remainder 11
Divisible by 100No, remainder 7
Collatz (3n + 1) trajectory
Steps to reach 195the total stopping time
Highest value reached43,135,2526× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps6,390,407 → 19,171,222 → 9,585,611 → 28,756,834 → 14,378,417 → 43,135,252 → 21,567,626 → 10,783,813 → 32,351,440 → 16,175,720 → …
Last steps… → 32 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage639,040,700%
6,390,407% as a decimal63,904.07
6,390,407% of 1006,390,407
6,390,407% of 1,00063,904,070
As a fraction of 1006,390,407/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,390,407
Nerdulate something else
Nothing in mind? Surprise me · today’s page