Recognised as Number
6,373,147
- Positive
- Odd
- Composite
- 7 digits
6,373,147 is an odd 7-digit integer and a composite number. It has 16 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value6,373,147
Digit count7
Digit sum31
Digit product10,584
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation11 × 17 × 173 × 197
Distinct prime factors411, 17, 173, 197
Number of divisors16
Sum of divisors σ(n)7,441,632
Aliquot sum1,068,485sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)5,393,920integers below n that share no factor with it
Carmichael function λ(n)168,560the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 5,393,920
Möbius function μ(n)+14 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 11, 17, 173, 187, 197, 1,903, 2,167, 2,941, 3,349, 32,351, 34,081, 36,839, 374,891, 579,377, 6,373,14716 in total
Arithmetic
Previous number6,373,146
Next number6,373,148
Double12,746,294
Half3,186,573.5
Square40,617,002,683,609
Cube258,858,128,802,034,647,523
Square root2,524.509259242≈irrational, shown to 9 decimal places
Cube root185.40352144≈
Negation-6,373,147
Reciprocal1.56908353 × 10^-7≈
Representations
Decimal6,373,147
Binary1100001001111110001101123 bits
Octal30237433
Hexadecimal613F1B
Base 363SLJV
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordssix million, three hundred and seventy-three thousand, one hundred and forty-seven
Ordinalsix million, three hundred and seventy-three thousand, one hundred and forty-seventh
Scientific notation6.373147 × 10^6
Engineering notation6.373147 × 10^6
In other bases
Ternary102222210022111base 3; the most digit-efficient integer base after e: 15 digits
Quinary3112420042base 5; one hand: 10 digits
Septenary105112414base 7: 9 digits
Nonary12883274base 9; each digit is two ternary digits: 8 digits
Duodecimal21741b7base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal1jgch7base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal29:30:19:7base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary110000T1010T111digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101000010100001101101111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000011000010011111100011011
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
Bytes361 3f 1b
Gray code10100011010000010010110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000011000010011111100011011
64-bit0000000000000000000000000000000000000000011000010011111100011011
One's complement11111111100111101100000011100100at 32 bits, every bit flipped
Bits reversed11011000111111001000011000000000at 32 bits
Rotated left by 100000000110000100111111000110110at 32 bits, wrapping
Shifted left by 1110000100111111000110110= 12,746,294, no wrap
Shifted right by 11100001001111110001101= 3,186,573, discarding the low bit
These bits as a double3.14875299 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
6,373,147 to the power 240,617,002,683,609
6,373,147 to the power 3258,858,128,802,034,647,523
6,373,147 to the power 41,649,740,907,000,300,707,757,264,881
6,373,147 to the power 510,514,041,312,226,245,454,741,089,404,550,507
First ten multiples6,373,147, 12,746,294, 19,119,441, 25,492,588, 31,865,735, 38,238,882, 44,612,029, 50,985,176, 57,358,323, 63,731,470
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 3
Divisible by 5No, remainder 2
Divisible by 6No, remainder 1
Divisible by 7No, remainder 4
Divisible by 8No, remainder 3
Divisible by 9No, remainder 4
Divisible by 10No, remainder 7
Divisible by 11Yes
Divisible by 12No, remainder 7
Divisible by 100No, remainder 47
Collatz (3n + 1) trajectory
Steps to reach 1232the total stopping time
Highest value reached413,446,33664× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps6,373,147 → 19,119,442 → 9,559,721 → 28,679,164 → 14,339,582 → 7,169,791 → 21,509,374 → 10,754,687 → 32,264,062 → 16,132,031 → …
Last steps… → 32 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage637,314,700%
6,373,147% as a decimal63,731.47
6,373,147% of 1006,373,147
6,373,147% of 1,00063,731,470
As a fraction of 1006,373,147/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,373,147
Nerdulate something else
Nothing in mind? Surprise me · today’s page