Recognised as Number
4,791,504
- Positive
- Even
- Composite
- 7 digits
4,791,504 is an even 7-digit integer and a composite number. It has 20 divisors and a digital root of 3.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value4,791,504
Digit count7
Digit sum30
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root3repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2^4 × 3 × 99,823
Distinct prime factors32, 3, 99,823
Number of divisors20
Sum of divisors σ(n)12,378,176
Aliquot sum7,586,672sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)1,597,152integers below n that share no factor with it
Carmichael function λ(n)199,644the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,597,152
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 3, 4, 6, 8, 12, 16, 24, 48, 99,823, 199,646, 299,469, 399,292, 598,938, 798,584, 1,197,876, 1,597,168, 2,395,752, 4,791,50420 in total
Arithmetic
Previous number4,791,503
Next number4,791,505
Double9,583,008
Half2,395,752
Square22,958,510,582,016
Cube110,005,795,287,771,992,064
Square root2,188.950433427≈irrational, shown to 9 decimal places
Cube root168.586949228≈
Negation-4,791,504
Reciprocal2.08702737 × 10^-7≈
Representations
Decimal4,791,504
Binary1001001000111001101000023 bits
Octal22216320
Hexadecimal491CD0
Base 362UP5C
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfour million, seven hundred and ninety-one thousand, five hundred and four
Ordinalfour million, seven hundred and ninety-one thousand, five hundred and fourth
Scientific notation4.791504 × 10^6
Engineering notation4.791504 × 10^6
In other bases
Ternary100000102201010base 3; the most digit-efficient integer base after e: 15 digits
Quinary2211312004base 5; one hand: 10 digits
Septenary55504254base 7: 8 digits
Nonary10012633base 9; each digit is two ternary digits: 8 digits
Duodecimal1730a40base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal19iif4base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal22:10:58:24base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary100000110T01010digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10110010110110111010000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000010010010001110011010000
Bit length23 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits14within that length
Bit parityodd9 set bits, so odd; not the same as the number itself being even
Highest set bitbit 22worth 4,194,304
Lowest set bitbit 44 trailing zeros
Power of twoNo
Bytes349 1c d0
Gray code11011011001001010111000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000010010010001110011010000
64-bit0000000000000000000000000000000000000000010010010001110011010000
One's complement11111111101101101110001100101111at 32 bits, every bit flipped
Bits reversed00001011001110001001001000000000at 32 bits
Rotated left by 100000000100100100011100110100000at 32 bits, wrapping
Shifted left by 1100100100011100110100000= 9,583,008, no wrap
Shifted right by 11001001000111001101000= 2,395,752, discarding the low bit
These bits as a double2.36731752 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
4,791,504 to the power 222,958,510,582,016
4,791,504 to the power 3110,005,795,287,771,992,064
4,791,504 to the power 4527,093,208,144,540,651,062,624,256
4,791,504 to the power 52,525,569,215,197,399,107,729,168,373,121,024
First ten multiples4,791,504, 9,583,008, 14,374,512, 19,166,016, 23,957,520, 28,749,024, 33,540,528, 38,332,032, 43,123,536, 47,915,040
Powers of twoBetween 2^22 (4,194,304) and 2^23 (8,388,608)
Divisibility tests
Divisible by 2Yes
Divisible by 3Yes
Divisible by 4Yes
Divisible by 5No, remainder 4
Divisible by 6Yes
Divisible by 7No, remainder 4
Divisible by 8Yes
Divisible by 9No, remainder 3
Divisible by 10No, remainder 4
Divisible by 11No, remainder 3
Divisible by 12Yes
Divisible by 100No, remainder 4
Collatz (3n + 1) trajectory
Steps to reach 1100the total stopping time
Highest value reached4,791,504
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps4,791,504 → 2,395,752 → 1,197,876 → 598,938 → 299,469 → 898,408 → 449,204 → 224,602 → 112,301 → 336,904 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage479,150,400%
4,791,504% as a decimal47,915.04
4,791,504% of 1004,791,504
4,791,504% of 1,00047,915,040
As a fraction of 1004,791,504/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,791,504
Nerdulate something else
Nothing in mind? Surprise me · today’s page