Recognised as Number
3,340,633
- Positive
- Odd
- Prime
- 7 digits
3,340,633 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value3,340,633
Digit count7
Digit sum22
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3,340,633
Distinct prime factors13,340,633
Number of divisors2
Sum of divisors σ(n)3,340,634
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,340,632integers below n that share no factor with it
Carmichael function λ(n)3,340,632the 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, 3,340,6332 in total
Arithmetic
Previous number3,340,632
Next number3,340,634
Double6,681,266
Half1,670,316.5
Square11,159,828,840,689
Cube37,280,892,499,557,416,137
Square root1,827.73986114≈irrational, shown to 9 decimal places
Cube root149.489121254≈
Negation-3,340,633
Reciprocal2.99344466 × 10^-7≈
Representations
Decimal3,340,633
Binary110010111110010101100122 bits
Octal14574531
Hexadecimal32F959
Base 361ZLND
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, three hundred and forty thousand, six hundred and thirty-three
Ordinalthree million, three hundred and forty thousand, six hundred and thirty-third
Scientific notation3.340633 × 10^6
Engineering notation3.340633 × 10^6
In other bases
Ternary20021201111011base 3; the most digit-efficient integer base after e: 14 digits
Quinary1323400013base 5; one hand: 10 digits
Septenary40252312base 7: 8 digits
Nonary6251434base 9; each digit is two ternary digits: 7 digits
Duodecimal11512a1base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal10hbbdbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal15:27:57:13base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T010TT01111011digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101110000111010101001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001100101111100101011001
Bit length22 bitsto write the magnitude
Set bits13the population count, or Hamming weight
Zero bits9within that length
Bit parityodd13 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
Bytes332 f9 59
Gray code1010111000010111110101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001100101111100101011001
64-bit0000000000000000000000000000000000000000001100101111100101011001
One's complement11111111110011010000011010100110at 32 bits, every bit flipped
Bits reversed10011010100111110100110000000000at 32 bits
Rotated left by 100000000011001011111001010110010at 32 bits, wrapping
Shifted left by 111001011111001010110010= 6,681,266, no wrap
Shifted right by 1110010111110010101100= 1,670,316, discarding the low bit
These bits as a double1.650492 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,340,633 to the power 211,159,828,840,689
3,340,633 to the power 337,280,892,499,557,416,137
3,340,633 to the power 4124,541,779,753,473,989,741,994,721
3,340,633 to the power 5416,048,379,323,187,074,773,769,050,798,393
First ten multiples3,340,633, 6,681,266, 10,021,899, 13,362,532, 16,703,165, 20,043,798, 23,384,431, 26,725,064, 30,065,697, 33,406,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 2
Divisible by 8No, remainder 1
Divisible by 9No, remainder 4
Divisible by 10No, remainder 3
Divisible by 11No, remainder 10
Divisible by 12No, remainder 1
Divisible by 100No, remainder 33
Collatz (3n + 1) trajectory
Steps to reach 1115the total stopping time
Highest value reached11,274,6403× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,340,633 → 10,021,900 → 5,010,950 → 2,505,475 → 7,516,426 → 3,758,213 → 11,274,640 → 5,637,320 → 2,818,660 → 1,409,330 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage334,063,300%
3,340,633% as a decimal33,406.33
3,340,633% of 1003,340,633
3,340,633% of 1,00033,406,330
As a fraction of 1003,340,633/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 3,340,633
Nerdulate something else
Nothing in mind? Surprise me · today’s page