Recognised as Number
9,048,379
- Positive
- Odd
- Prime
- 7 digits
9,048,379 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value9,048,379
Digit count7
Digit sum40
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times 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 factorisation9,048,379
Distinct prime factors19,048,379
Number of divisors2
Sum of divisors σ(n)9,048,380
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)9,048,378integers below n that share no factor with it
Carmichael function λ(n)9,048,378the 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, 9,048,3792 in total
Arithmetic
Previous number9,048,378
Next number9,048,380
Double18,096,758
Half4,524,189.5
Square81,873,162,527,641
Cube740,819,404,478,693,743,939
Square root3,008.052359917≈irrational, shown to 9 decimal places
Cube root208.380428962≈
Negation-9,048,379
Reciprocal1.10517033 × 10^-7≈
Representations
Decimal9,048,379
Binary10001010000100010011101124 bits
Octal42410473
Hexadecimal8A113B
Base 365DXRV
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsnine million, forty-eight thousand, three hundred and seventy-nine
Ordinalnine million, forty-eight thousand, three hundred and seventy-ninth
Scientific notation9.048379 × 10^6
Engineering notation9.048379 × 10^6
In other bases
Ternary122000201001011base 3; the most digit-efficient integer base after e: 15 digits
Quinary4304022004base 5; one hand: 10 digits
Septenary136624054base 7: 9 digits
Nonary18021034base 9; each digit is two ternary digits: 8 digits
Duodecimal30443b7base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal2gb0ijbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal41:53:26:19base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T0T001T01001011digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1100111100001000101001111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000100010100001000100111011
Bit length24 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits14within that length
Bit parityeven10 set bits, so even; not the same as the number itself being odd
Highest set bitbit 23worth 8,388,608
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes38a 11 3b
Gray code110011110001100110100110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000100010100001000100111011
64-bit0000000000000000000000000000000000000000100010100001000100111011
One's complement11111111011101011110111011000100at 32 bits, every bit flipped
Bits reversed11011100100010000101000100000000at 32 bits
Rotated left by 100000001000101000010001001110110at 32 bits, wrapping
Shifted left by 11000101000010001001110110= 18,096,758, no wrap
Shifted right by 110001010000100010011101= 4,524,189, discarding the low bit
These bits as a double4.47049321 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
9,048,379 to the power 281,873,162,527,641
9,048,379 to the power 3740,819,404,478,693,743,939
9,048,379 to the power 46,703,214,742,277,518,420,089,024,881
9,048,379 to the power 560,653,227,506,514,309,844,446,710,863,717,899
First ten multiples9,048,379, 18,096,758, 27,145,137, 36,193,516, 45,241,895, 54,290,274, 63,338,653, 72,387,032, 81,435,411, 90,483,790
Powers of twoBetween 2^23 (8,388,608) and 2^24 (16,777,216)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 3
Divisible by 5No, remainder 4
Divisible by 6No, remainder 1
Divisible by 7No, remainder 4
Divisible by 8No, remainder 3
Divisible by 9No, remainder 4
Divisible by 10No, remainder 9
Divisible by 11No, remainder 10
Divisible by 12No, remainder 7
Divisible by 100No, remainder 79
Collatz (3n + 1) trajectory
Steps to reach 1225the total stopping time
Highest value reached45,807,4245× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps9,048,379 → 27,145,138 → 13,572,569 → 40,717,708 → 20,358,854 → 10,179,427 → 30,538,282 → 15,269,141 → 45,807,424 → 22,903,712 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage904,837,900%
9,048,379% as a decimal90,483.79
9,048,379% of 1009,048,379
9,048,379% of 1,00090,483,790
As a fraction of 1009,048,379/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,048,379
Nerdulate something else
Nothing in mind? Surprise me · today’s page