Recognised as Number
8,373,141
- Positive
- Odd
- Composite
- 7 digits
8,373,141 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 value8,373,141
Digit count7
Digit sum27
Digit product2,016
Multiplicative persistence2times 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 × 7 × 29 × 4,583
Distinct prime factors43, 7, 29, 4,583
Number of divisors24
Sum of divisors σ(n)14,302,080
Aliquot sum5,928,939sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)4,618,656integers below n that share no factor with it
Carmichael function λ(n)192,444the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 4,618,656
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 3, 7, 9, 21, 29, 63, 87, 203, 261, 609, 1,827, 4,583, 13,749, 32,081, 41,247, 96,243, 132,907, 288,729, 398,721, 930,349, 1,196,163, 2,791,047, 8,373,14124 in total
Arithmetic
Previous number8,373,140
Next number8,373,142
Double16,746,282
Half4,186,570.5
Square70,109,490,205,881
Cube587,036,646,931,960,642,221
Square root2,893.638021592≈irrational, shown to 9 decimal places
Cube root203.062378203≈
Negation-8,373,141
Reciprocal1.19429495 × 10^-7≈
Representations
Decimal8,373,141
Binary1111111110000111001010123 bits
Octal37741625
Hexadecimal7FC395
Base 364ZGR9
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordseight million, three hundred and seventy-three thousand, one hundred and forty-one
Ordinaleight million, three hundred and seventy-three thousand, one hundred and forty-first
Scientific notation8.373141 × 10^6
Engineering notation8.373141 × 10^6
In other bases
Ternary120202101210100base 3; the most digit-efficient integer base after e: 15 digits
Quinary4120420031base 5; one hand: 10 digits
Septenary131112330base 7: 9 digits
Nonary16671710base 9; each digit is two ternary digits: 8 digits
Duodecimal2979699base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal2c6ch1base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal38:45:52:21base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1TT1T1T11TT10100digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1100000001100010010010101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000011111111100001110010101
Bit length23 bitsto write the magnitude
Set bits15the population count, or Hamming weight
Zero bits8within that length
Bit parityodd15 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
Bytes37f c3 95
Gray code10000000010001001011111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000011111111100001110010101
64-bit0000000000000000000000000000000000000000011111111100001110010101
One's complement11111111100000000011110001101010at 32 bits, every bit flipped
Bits reversed10101001110000111111111000000000at 32 bits
Rotated left by 100000000111111111000011100101010at 32 bits, wrapping
Shifted left by 1111111111000011100101010= 16,746,282, no wrap
Shifted right by 11111111110000111001010= 4,186,570, discarding the low bit
These bits as a double4.13688132 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
8,373,141 to the power 270,109,490,205,881
8,373,141 to the power 3587,036,646,931,960,642,221
8,373,141 to the power 44,915,340,616,928,523,863,766,986,161
8,373,141 to the power 541,156,840,048,569,517,233,185,766,271,101,701
First ten multiples8,373,141, 16,746,282, 25,119,423, 33,492,564, 41,865,705, 50,238,846, 58,611,987, 66,985,128, 75,358,269, 83,731,410
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 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 3
Divisible by 7Yes
Divisible by 8No, remainder 5
Divisible by 9Yes
Divisible by 10No, remainder 1
Divisible by 11No, remainder 7
Divisible by 12No, remainder 9
Divisible by 100No, remainder 41
Collatz (3n + 1) trajectory
Steps to reach 1230the total stopping time
Highest value reached25,119,4243× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps8,373,141 → 25,119,424 → 12,559,712 → 6,279,856 → 3,139,928 → 1,569,964 → 784,982 → 392,491 → 1,177,474 → 588,737 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage837,314,100%
8,373,141% as a decimal83,731.41
8,373,141% of 1008,373,141
8,373,141% of 1,00083,731,410
As a fraction of 1008,373,141/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 8,373,141
Nerdulate something else
Nothing in mind? Surprise me · today’s page