Recognised as Number
5,529,231
- Positive
- Odd
- Composite
- 7 digits
5,529,231 is an odd 7-digit integer and a composite number. It has 12 divisors and a digital root of 9.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value5,529,231
Digit count7
Digit sum27
Digit product2,700
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 × 379 × 1,621
Distinct prime factors33, 379, 1,621
Number of divisors12
Sum of divisors σ(n)8,012,680
Aliquot sum2,483,449sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,674,160integers below n that share no factor with it
Carmichael function λ(n)11,340the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 3,674,160
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 3, 9, 379, 1,137, 1,621, 3,411, 4,863, 14,589, 614,359, 1,843,077, 5,529,23112 in total
Arithmetic
Previous number5,529,230
Next number5,529,232
Double11,058,462
Half2,764,615.5
Square30,572,395,451,361
Cube169,041,836,673,924,233,391
Square root2,351.431691545≈irrational, shown to 9 decimal places
Cube root176.829578376≈
Negation-5,529,231
Reciprocal1.80856976 × 10^-7≈
Representations
Decimal5,529,231
Binary1010100010111101000111123 bits
Octal25057217
Hexadecimal545E8F
Base 363AIDR
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfive million, five hundred and twenty-nine thousand, two hundred and thirty-one
Ordinalfive million, five hundred and twenty-nine thousand, two hundred and thirty-first
Scientific notation5.529231 × 10^6
Engineering notation5.529231 × 10^6
In other bases
Ternary101101220200100base 3; the most digit-efficient integer base after e: 15 digits
Quinary2403413411base 5; one hand: 10 digits
Septenary64666131base 7: 8 digits
Nonary11356610base 9; each digit is two ternary digits: 8 digits
Duodecimal1a27953base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal1eb31bbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal25:35:53:51base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10111T0T1T00100digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10101011010001110010011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000010101000101111010001111
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
Bytes354 5e 8f
Gray code11111100111000111001000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000010101000101111010001111
64-bit0000000000000000000000000000000000000000010101000101111010001111
One's complement11111111101010111010000101110000at 32 bits, every bit flipped
Bits reversed11110001011110100010101000000000at 32 bits
Rotated left by 100000000101010001011110100011110at 32 bits, wrapping
Shifted left by 1101010001011110100011110= 11,058,462, no wrap
Shifted right by 11010100010111101000111= 2,764,615, discarding the low bit
These bits as a double2.73180309 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
5,529,231 to the power 230,572,395,451,361
5,529,231 to the power 3169,041,836,673,924,233,391
5,529,231 to the power 4934,671,363,634,398,762,916,752,321
5,529,231 to the power 55,168,013,878,619,590,306,280,957,352,595,151
First ten multiples5,529,231, 11,058,462, 16,587,693, 22,116,924, 27,646,155, 33,175,386, 38,704,617, 44,233,848, 49,763,079, 55,292,310
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 5No, remainder 1
Divisible by 6No, remainder 3
Divisible by 7No, remainder 1
Divisible by 8No, remainder 7
Divisible by 9Yes
Divisible by 10No, remainder 1
Divisible by 11No, remainder 4
Divisible by 12No, remainder 3
Divisible by 100No, remainder 31
Collatz (3n + 1) trajectory
Steps to reach 1139the total stopping time
Highest value reached55,983,47210× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps5,529,231 → 16,587,694 → 8,293,847 → 24,881,542 → 12,440,771 → 37,322,314 → 18,661,157 → 55,983,472 → 27,991,736 → 13,995,868 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage552,923,100%
5,529,231% as a decimal55,292.31
5,529,231% of 1005,529,231
5,529,231% of 1,00055,292,310
As a fraction of 1005,529,231/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 5,529,231
Nerdulate something else
Nothing in mind? Surprise me · today’s page