Recognised as Number
2,232,133
- Positive
- Odd
- Prime
- 7 digits
2,232,133 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value2,232,133
Digit count7
Digit sum16
Digit product216
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2,232,133
Distinct prime factors12,232,133
Number of divisors2
Sum of divisors σ(n)2,232,134
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,232,132integers below n that share no factor with it
Carmichael function λ(n)2,232,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, 2,232,1332 in total
Arithmetic
Previous number2,232,132
Next number2,232,134
Double4,464,266
Half1,116,066.5
Square4,982,417,729,689
Cube11,121,419,034,223,896,637
Square root1,494.032462833≈irrational, shown to 9 decimal places
Cube root130.689297268≈
Negation-2,232,133
Reciprocal4.48001978 × 10^-7≈
Representations
Decimal2,232,133
Binary100010000011110100010122 bits
Octal10407505
Hexadecimal220F45
Base 361BUBP
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, two hundred and thirty-two thousand, one hundred and thirty-three
Ordinaltwo million, two hundred and thirty-two thousand, one hundred and thirty-third
Scientific notation2.232133 × 10^6
Engineering notation2.232133 × 10^6
In other bases
Ternary11012101220121base 3; the most digit-efficient integer base after e: 14 digits
Quinary1032412013base 5; one hand: 10 digits
Septenary24654451base 7: 8 digits
Nonary4171817base 9; each digit is two ternary digits: 7 digits
Duodecimal8b78b1base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimaldj06dbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal10:20:2:13base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary111TT11T0T1TT1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11001100001001101000101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001000100000111101000101
Bit length22 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits13within that length
Bit parityodd9 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 21worth 2,097,152
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes322 0f 45
Gray code1100110000100011100111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001000100000111101000101
64-bit0000000000000000000000000000000000000000001000100000111101000101
One's complement11111111110111011111000010111010at 32 bits, every bit flipped
Bits reversed10100010111100000100010000000000at 32 bits
Rotated left by 100000000010001000001111010001010at 32 bits, wrapping
Shifted left by 110001000001111010001010= 4,464,266, no wrap
Shifted right by 1100010000011110100010= 1,116,066, discarding the low bit
These bits as a double1.10282023 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,232,133 to the power 24,982,417,729,689
2,232,133 to the power 311,121,419,034,223,896,637
2,232,133 to the power 424,824,486,433,119,289,072,036,721
2,232,133 to the power 555,411,555,375,417,858,074,232,542,155,893
First ten multiples2,232,133, 4,464,266, 6,696,399, 8,928,532, 11,160,665, 13,392,798, 15,624,931, 17,857,064, 20,089,197, 22,321,330
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 1
Divisible by 5No, remainder 3
Divisible by 6No, remainder 1
Divisible by 7No, remainder 1
Divisible by 8No, remainder 5
Divisible by 9No, remainder 7
Divisible by 10No, remainder 3
Divisible by 11No, remainder 2
Divisible by 12No, remainder 1
Divisible by 100No, remainder 33
Collatz (3n + 1) trajectory
Steps to reach 1117the total stopping time
Highest value reached6,696,4003× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,232,133 → 6,696,400 → 3,348,200 → 1,674,100 → 837,050 → 418,525 → 1,255,576 → 627,788 → 313,894 → 156,947 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage223,213,300%
2,232,133% as a decimal22,321.33
2,232,133% of 1002,232,133
2,232,133% of 1,00022,321,330
As a fraction of 1002,232,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 2,232,133
Nerdulate something else
Nothing in mind? Surprise me · today’s page