Recognised as Number
9,478,142
- Positive
- Even
- Composite
- 7 digits
9,478,142 is an even 7-digit integer and a composite number. It has 16 divisors and a digital root of 8.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value9,478,142
Digit count7
Digit sum35
Digit product16,128
Multiplicative persistence5times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2 × 37 × 349 × 367
Distinct prime factors42, 37, 349, 367
Number of divisors16
Sum of divisors σ(n)14,683,200
Aliquot sum5,205,058sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)4,585,248integers below n that share no factor with it
Carmichael function λ(n)63,684the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 4,585,248
Möbius function μ(n)+14 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 37, 74, 349, 367, 698, 734, 12,913, 13,579, 25,826, 27,158, 128,083, 256,166, 4,739,071, 9,478,14216 in total
Arithmetic
Previous number9,478,141
Next number9,478,143
Double18,956,284
Half4,739,071
Square89,835,175,772,164
Cube851,470,552,563,530,039,288
Square root3,078.65912371≈irrational, shown to 9 decimal places
Cube root211.628621788≈
Negation-9,478,142
Reciprocal1.0550591 × 10^-7≈
Representations
Decimal9,478,142
Binary10010000100111111111111024 bits
Octal44117776
Hexadecimal909FFE
Base 365N5DQ
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsnine million, four hundred and seventy-eight thousand, one hundred and forty-two
Ordinalnine million, four hundred and seventy-eight thousand, one hundred and forty-second
Scientific notation9.478142 × 10^6
Engineering notation9.478142 × 10^6
In other bases
Ternary122211112120022base 3; the most digit-efficient integer base after e: 15 digits
Quinary4411300032base 5; one hand: 10 digits
Septenary143364032base 7: 9 digits
Nonary18745508base 9; each digit is two ternary digits: 8 digits
Duodecimal3211052base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal2j4f72base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal43:52:49:2base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T000TTTT0TT010Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1100100011110000000000010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000100100001001111111111110
Bit length24 bitsto write the magnitude
Set bits15the population count, or Hamming weight
Zero bits9within that length
Bit parityodd15 set bits, so odd; not the same as the number itself being even
Highest set bitbit 23worth 8,388,608
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes390 9f fe
Gray code110110001101000000000001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000100100001001111111111110
64-bit0000000000000000000000000000000000000000100100001001111111111110
One's complement11111111011011110110000000000001at 32 bits, every bit flipped
Bits reversed01111111111110010000100100000000at 32 bits
Rotated left by 100000001001000010011111111111100at 32 bits, wrapping
Shifted left by 11001000010011111111111100= 18,956,284, no wrap
Shifted right by 110010000100111111111111= 4,739,071, discarding the low bit
These bits as a double4.68282435 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
9,478,142 to the power 289,835,175,772,164
9,478,142 to the power 3851,470,552,563,530,039,288
9,478,142 to the power 48,070,358,806,015,601,733,637,242,896
9,478,142 to the power 576,492,006,754,366,327,446,859,964,656,779,232
First ten multiples9,478,142, 18,956,284, 28,434,426, 37,912,568, 47,390,710, 56,868,852, 66,346,994, 75,825,136, 85,303,278, 94,781,420
Powers of twoBetween 2^23 (8,388,608) and 2^24 (16,777,216)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 2
Divisible by 4No, remainder 2
Divisible by 5No, remainder 2
Divisible by 6No, remainder 2
Divisible by 7No, remainder 2
Divisible by 8No, remainder 6
Divisible by 9No, remainder 8
Divisible by 10No, remainder 2
Divisible by 11No, remainder 3
Divisible by 12No, remainder 2
Divisible by 100No, remainder 42
Collatz (3n + 1) trajectory
Steps to reach 1124the total stopping time
Highest value reached1,229,754,472129× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps9,478,142 → 4,739,071 → 14,217,214 → 7,108,607 → 21,325,822 → 10,662,911 → 31,988,734 → 15,994,367 → 47,983,102 → 23,991,551 → …
Last steps… → 32 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage947,814,200%
9,478,142% as a decimal94,781.42
9,478,142% of 1009,478,142
9,478,142% of 1,00094,781,420
As a fraction of 1009,478,142/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 9,478,142
Nerdulate something else
Nothing in mind? Surprise me · today’s page