Recognised as Number
4,483,749
- Positive
- Odd
- Composite
- 7 digits
4,483,749 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 3.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value4,483,749
Digit count7
Digit sum39
Digit product96,768
Multiplicative persistence5times the digit product can be taken before one digit is left
Digital root3repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3 × 1,494,583
Distinct prime factors23, 1,494,583
Number of divisors4
Sum of divisors σ(n)5,978,336
Aliquot sum1,494,587sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,989,164integers below n that share no factor with it
Carmichael function λ(n)1,494,582the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,989,164
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 3, 1,494,583, 4,483,7494 in total
Arithmetic
Previous number4,483,748
Next number4,483,750
Double8,967,498
Half2,241,874.5
Square20,104,005,095,001
Cube90,141,312,740,705,638,749
Square root2,117.486481657≈irrational, shown to 9 decimal places
Cube root164.897383393≈
Negation-4,483,749
Reciprocal2.23027649 × 10^-7≈
Representations
Decimal4,483,749
Binary1000100011010101010010123 bits
Octal21065245
Hexadecimal446AA5
Base 362O3OL
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfour million, four hundred and eighty-three thousand, seven hundred and forty-nine
Ordinalfour million, four hundred and eighty-three thousand, seven hundred and forty-ninth
Scientific notation4.483749 × 10^6
Engineering notation4.483749 × 10^6
In other bases
Ternary22102210112210base 3; the most digit-efficient integer base after e: 14 digits
Quinary2121434444base 5; one hand: 10 digits
Septenary53053104base 7: 8 digits
Nonary8383483base 9; each digit is two ternary digits: 7 digits
Duodecimal1602919base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal180979base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal20:45:29:9base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10T110T11TT0T10digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10001011011111111100101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000010001000110101010100101
Bit length23 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits13within that length
Bit parityeven10 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 6a a5
Gray code11001100101111111110111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000010001000110101010100101
64-bit0000000000000000000000000000000000000000010001000110101010100101
One's complement11111111101110111001010101011010at 32 bits, every bit flipped
Bits reversed10100101010101100010001000000000at 32 bits
Rotated left by 100000000100010001101010101001010at 32 bits, wrapping
Shifted left by 1100010001101010101001010= 8,967,498, no wrap
Shifted right by 11000100011010101010010= 2,241,874, discarding the low bit
These bits as a double2.21526635 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
4,483,749 to the power 220,104,005,095,001
4,483,749 to the power 390,141,312,740,705,638,749
4,483,749 to the power 4404,171,020,859,826,167,035,190,001
4,483,749 to the power 51,812,201,410,609,224,716,617,866,131,793,749
First ten multiples4,483,749, 8,967,498, 13,451,247, 17,934,996, 22,418,745, 26,902,494, 31,386,243, 35,869,992, 40,353,741, 44,837,490
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 4
Divisible by 6No, remainder 3
Divisible by 7No, remainder 4
Divisible by 8No, remainder 5
Divisible by 9No, remainder 3
Divisible by 10No, remainder 9
Divisible by 11No, remainder 6
Divisible by 12No, remainder 9
Divisible by 100No, remainder 49
Collatz (3n + 1) trajectory
Steps to reach 1247the total stopping time
Highest value reached8,501,092,0721,895× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps4,483,749 → 13,451,248 → 6,725,624 → 3,362,812 → 1,681,406 → 840,703 → 2,522,110 → 1,261,055 → 3,783,166 → 1,891,583 → …
Last steps… → 32 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage448,374,900%
4,483,749% as a decimal44,837.49
4,483,749% of 1004,483,749
4,483,749% of 1,00044,837,490
As a fraction of 1004,483,749/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,483,749
Nerdulate something else
Nothing in mind? Surprise me · today’s page