Recognised as Number
4,975,091
- Positive
- Odd
- Composite
- 7 digits
4,975,091 is an odd 7-digit integer and a composite number. It has 8 divisors and a digital root of 8.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value4,975,091
Digit count7
Digit sum35
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times 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 factorisation11 × 47 × 9,623
Distinct prime factors311, 47, 9,623
Number of divisors8
Sum of divisors σ(n)5,543,424
Aliquot sum568,333sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)4,426,120integers below n that share no factor with it
Carmichael function λ(n)1,106,530the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 4,426,120
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 11, 47, 517, 9,623, 105,853, 452,281, 4,975,0918 in total
Arithmetic
Previous number4,975,090
Next number4,975,092
Double9,950,182
Half2,487,545.5
Square24,751,530,458,281
Cube123,141,116,419,219,678,571
Square root2,230.491201507≈irrational, shown to 9 decimal places
Cube root170.713163211≈
Negation-4,975,091
Reciprocal2.01001349 × 10^-7≈
Representations
Decimal4,975,091
Binary1001011111010011111001123 bits
Octal22764763
Hexadecimal4BE9F3
Base 362YMSZ
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfour million, nine hundred and seventy-five thousand and ninety-one
Ordinalfour million, nine hundred and seventy-five thousand and ninety-first
Scientific notation4.975091 × 10^6
Engineering notation4.975091 × 10^6
In other bases
Ternary100100202112122base 3; the most digit-efficient integer base after e: 15 digits
Quinary2233200331base 5; one hand: 10 digits
Septenary60200432base 7: 8 digits
Nonary10322478base 9; each digit is two ternary digits: 8 digits
Duodecimal17bb12bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal1b1hebbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal23:1:58:11base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary100101T10TT0T0Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10111000011111000110111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000010010111110100111110011
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
Bytes34b e9 f3
Gray code11011100001110100001010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000010010111110100111110011
64-bit0000000000000000000000000000000000000000010010111110100111110011
One's complement11111111101101000001011000001100at 32 bits, every bit flipped
Bits reversed11001111100101111101001000000000at 32 bits
Rotated left by 100000000100101111101001111100110at 32 bits, wrapping
Shifted left by 1100101111101001111100110= 9,950,182, no wrap
Shifted right by 11001011111010011111001= 2,487,545, discarding the low bit
These bits as a double2.45802155 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
4,975,091 to the power 224,751,530,458,281
4,975,091 to the power 3123,141,116,419,219,678,571
4,975,091 to the power 4612,638,260,027,212,049,881,474,961
4,975,091 to the power 53,047,931,093,717,042,424,456,877,145,196,451
First ten multiples4,975,091, 9,950,182, 14,925,273, 19,900,364, 24,875,455, 29,850,546, 34,825,637, 39,800,728, 44,775,819, 49,750,910
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 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 2
Divisible by 8No, remainder 3
Divisible by 9No, remainder 8
Divisible by 10No, remainder 1
Divisible by 11Yes
Divisible by 12No, remainder 11
Divisible by 100No, remainder 91
Collatz (3n + 1) trajectory
Steps to reach 169the total stopping time
Highest value reached22,387,9124× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps4,975,091 → 14,925,274 → 7,462,637 → 22,387,912 → 11,193,956 → 5,596,978 → 2,798,489 → 8,395,468 → 4,197,734 → 2,098,867 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage497,509,100%
4,975,091% as a decimal49,750.91
4,975,091% of 1004,975,091
4,975,091% of 1,00049,750,910
As a fraction of 1004,975,091/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,975,091
Nerdulate something else
Nothing in mind? Surprise me · today’s page