Recognised as Number
4,729,133
- Positive
- Odd
- Prime
- 7 digits
4,729,133 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 2.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value4,729,133
Digit count7
Digit sum29
Digit product4,536
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation4,729,133
Distinct prime factors14,729,133
Number of divisors2
Sum of divisors σ(n)4,729,134
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)4,729,132integers below n that share no factor with it
Carmichael function λ(n)4,729,132the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)−11 distinct prime factor, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 4,729,1332 in total
Arithmetic
Previous number4,729,132
Next number4,729,134
Double9,458,266
Half2,364,566.5
Square22,364,698,931,689
Cube105,765,635,752,915,195,637
Square root2,174.656984446≈irrational, shown to 9 decimal places
Cube root167.852253418≈
Negation-4,729,133
Reciprocal2.1145525 × 10^-7≈
Representations
Decimal4,729,133
Binary1001000001010010010110123 bits
Octal22024455
Hexadecimal48292D
Base 362TD0T
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfour million, seven hundred and twenty-nine thousand, one hundred and thirty-three
Ordinalfour million, seven hundred and twenty-nine thousand, one hundred and thirty-third
Scientific notation4.729133 × 10^6
Engineering notation4.729133 × 10^6
In other bases
Ternary22220021011002base 3; the most digit-efficient integer base after e: 14 digits
Quinary2202313013base 5; one hand: 10 digits
Septenary55124363base 7: 8 digits
Nonary8807132base 9; each digit is two ternary digits: 7 digits
Duodecimal1700925base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal19b2gdbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal21:53:38:53base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1000T01T101101Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10110000111100101111101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000010010000010100100101101
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 odd
Highest set bitbit 22worth 4,194,304
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes348 29 2d
Gray code11011000011110110111011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000010010000010100100101101
64-bit0000000000000000000000000000000000000000010010000010100100101101
One's complement11111111101101111101011011010010at 32 bits, every bit flipped
Bits reversed10110100100101000001001000000000at 32 bits
Rotated left by 100000000100100000101001001011010at 32 bits, wrapping
Shifted left by 1100100000101001001011010= 9,458,266, no wrap
Shifted right by 11001000001010010010110= 2,364,566, discarding the low bit
These bits as a double2.33650215 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
4,729,133 to the power 222,364,698,931,689
4,729,133 to the power 3105,765,635,752,915,195,637
4,729,133 to the power 4500,179,758,305,091,097,888,392,721
4,729,133 to the power 52,365,416,600,932,630,379,030,228,333,840,893
First ten multiples4,729,133, 9,458,266, 14,187,399, 18,916,532, 23,645,665, 28,374,798, 33,103,931, 37,833,064, 42,562,197, 47,291,330
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 1
Divisible by 5No, remainder 3
Divisible by 6No, remainder 5
Divisible by 7No, remainder 3
Divisible by 8No, remainder 5
Divisible by 9No, remainder 2
Divisible by 10No, remainder 3
Divisible by 11No, remainder 2
Divisible by 12No, remainder 5
Divisible by 100No, remainder 33
Collatz (3n + 1) trajectory
Steps to reach 187the total stopping time
Highest value reached14,187,4003× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps4,729,133 → 14,187,400 → 7,093,700 → 3,546,850 → 1,773,425 → 5,320,276 → 2,660,138 → 1,330,069 → 3,990,208 → 1,995,104 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage472,913,300%
4,729,133% as a decimal47,291.33
4,729,133% of 1004,729,133
4,729,133% of 1,00047,291,330
As a fraction of 1004,729,133/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,729,133
Nerdulate something else
Nothing in mind? Surprise me · today’s page