Recognised as Number
4,488,947
- Positive
- Odd
- Composite
- 7 digits
4,488,947 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 8.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value4,488,947
Digit count7
Digit sum44
Digit product258,048
Multiplicative persistence2times 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 factorisation109 × 41,183
Distinct prime factors2109, 41,183
Number of divisors4
Sum of divisors σ(n)4,530,240
Aliquot sum41,293sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)4,447,656integers below n that share no factor with it
Carmichael function λ(n)2,223,828the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 4,447,656
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 109, 41,183, 4,488,9474 in total
Arithmetic
Previous number4,488,946
Next number4,488,948
Double8,977,894
Half2,244,473.5
Square20,150,645,168,809
Cube90,455,178,178,589,654,123
Square root2,118.71352476≈irrational, shown to 9 decimal places
Cube root164.961080505≈
Negation-4,488,947
Reciprocal2.22769393 × 10^-7≈
Representations
Decimal4,488,947
Binary1000100011111101111001123 bits
Octal21077363
Hexadecimal447EF3
Base 362O7OZ
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfour million, four hundred and eighty-eight thousand, nine hundred and forty-seven
Ordinalfour million, four hundred and eighty-eight thousand, nine hundred and forty-seventh
Scientific notation4.488947 × 10^6
Engineering notation4.488947 × 10^6
In other bases
Ternary22110001200022base 3; the most digit-efficient integer base after e: 14 digits
Quinary2122121242base 5; one hand: 10 digits
Septenary53104211base 7: 8 digits
Nonary8401608base 9; each digit is two ternary digits: 7 digits
Duodecimal160592bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal181277base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal20:46:55:47base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10T11001TT0010Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10001011000001100110111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000010001000111111011110011
Bit length23 bitsto write the magnitude
Set bits14the population count, or Hamming weight
Zero bits9within that length
Bit parityeven14 set bits, so even; 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
Bytes344 7e f3
Gray code11001100100000110001010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000010001000111111011110011
64-bit0000000000000000000000000000000000000000010001000111111011110011
One's complement11111111101110111000000100001100at 32 bits, every bit flipped
Bits reversed11001111011111100010001000000000at 32 bits
Rotated left by 100000000100010001111110111100110at 32 bits, wrapping
Shifted left by 1100010001111110111100110= 8,977,894, no wrap
Shifted right by 11000100011111101111001= 2,244,473, discarding the low bit
These bits as a double2.2178345 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
4,488,947 to the power 220,150,645,168,809
4,488,947 to the power 390,455,178,178,589,654,123
4,488,947 to the power 4406,048,500,719,245,492,106,478,481
4,488,947 to the power 51,822,730,199,158,154,894,054,900,257,849,507
First ten multiples4,488,947, 8,977,894, 13,466,841, 17,955,788, 22,444,735, 26,933,682, 31,422,629, 35,911,576, 40,400,523, 44,889,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 2
Divisible by 4No, remainder 3
Divisible by 5No, remainder 2
Divisible by 6No, remainder 5
Divisible by 7No, remainder 1
Divisible by 8No, remainder 3
Divisible by 9No, remainder 8
Divisible by 10No, remainder 7
Divisible by 11No, remainder 1
Divisible by 12No, remainder 11
Divisible by 100No, remainder 47
Collatz (3n + 1) trajectory
Steps to reach 1224the total stopping time
Highest value reached20,200,2644× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps4,488,947 → 13,466,842 → 6,733,421 → 20,200,264 → 10,100,132 → 5,050,066 → 2,525,033 → 7,575,100 → 3,787,550 → 1,893,775 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage448,894,700%
4,488,947% as a decimal44,889.47
4,488,947% of 1004,488,947
4,488,947% of 1,00044,889,470
As a fraction of 1004,488,947/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 4,488,947
Nerdulate something else
Nothing in mind? Surprise me · today’s page