Recognised as Number
4,749,255
- Positive
- Odd
- Composite
- 7 digits
4,749,255 is an odd 7-digit integer and a composite number. It has 24 divisors and a digital root of 9.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value4,749,255
Digit count7
Digit sum36
Digit product50,400
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3^2 × 5 × 7 × 15,077
Distinct prime factors43, 5, 7, 15,077
Number of divisors24
Sum of divisors σ(n)9,408,672
Aliquot sum4,659,417sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,170,944integers below n that share no factor with it
Carmichael function λ(n)45,228the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,170,944
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 3, 5, 7, 9, 15, 21, 35, 45, 63, 105, 315, 15,077, 45,231, 75,385, 105,539, 135,693, 226,155, 316,617, 527,695, 678,465, 949,851, 1,583,085, 4,749,25524 in total
Arithmetic
Previous number4,749,254
Next number4,749,256
Double9,498,510
Half2,374,627.5
Square22,555,423,055,025
Cube107,121,455,721,192,756,375
Square root2,179.278550346≈irrational, shown to 9 decimal places
Cube root168.089981559≈
Negation-4,749,255
Reciprocal2.1055934 × 10^-7≈
Representations
Decimal4,749,255
Binary1001000011101111100011123 bits
Octal22073707
Hexadecimal4877C7
Base 362TSJR
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfour million, seven hundred and forty-nine thousand, two hundred and fifty-five
Ordinalfour million, seven hundred and forty-nine thousand, two hundred and fifty-fifth
Scientific notation4.749255 × 10^6
Engineering notation4.749255 × 10^6
In other bases
Ternary22221021202100base 3; the most digit-efficient integer base after e: 14 digits
Quinary2203434010base 5; one hand: 10 digits
Septenary55240140base 7: 8 digits
Nonary8837670base 9; each digit is two ternary digits: 7 digits
Duodecimal17104b3base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal19dd2fbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal21:59:14:15base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1000T110TT1T100digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10110011000100011011011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000010010000111011111000111
Bit length23 bitsto write the magnitude
Set bits13the population count, or Hamming weight
Zero bits10within that length
Bit parityodd13 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
Bytes348 77 c7
Gray code11011000100110000100100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000010010000111011111000111
64-bit0000000000000000000000000000000000000000010010000111011111000111
One's complement11111111101101111000100000111000at 32 bits, every bit flipped
Bits reversed11100011111011100001001000000000at 32 bits
Rotated left by 100000000100100001110111110001110at 32 bits, wrapping
Shifted left by 1100100001110111110001110= 9,498,510, no wrap
Shifted right by 11001000011101111100011= 2,374,627, discarding the low bit
These bits as a double2.34644374 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
4,749,255 to the power 222,555,423,055,025
4,749,255 to the power 3107,121,455,721,192,756,375
4,749,255 to the power 4508,747,109,191,153,304,177,750,625
4,749,255 to the power 52,416,169,752,061,630,785,632,703,044,534,375
First ten multiples4,749,255, 9,498,510, 14,247,765, 18,997,020, 23,746,275, 28,495,530, 33,244,785, 37,994,040, 42,743,295, 47,492,550
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 3
Divisible by 5Yes
Divisible by 6No, remainder 3
Divisible by 7Yes
Divisible by 8No, remainder 7
Divisible by 9Yes
Divisible by 10No, remainder 5
Divisible by 11No, remainder 5
Divisible by 12No, remainder 3
Divisible by 100No, remainder 55
Collatz (3n + 1) trajectory
Steps to reach 1162the total stopping time
Highest value reached32,057,4766× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps4,749,255 → 14,247,766 → 7,123,883 → 21,371,650 → 10,685,825 → 32,057,476 → 16,028,738 → 8,014,369 → 24,043,108 → 12,021,554 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage474,925,500%
4,749,255% as a decimal47,492.55
4,749,255% of 1004,749,255
4,749,255% of 1,00047,492,550
As a fraction of 1004,749,255/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,749,255
Nerdulate something else
Nothing in mind? Surprise me · today’s page