Recognised as Number
3,390,551
- Positive
- Odd
- Prime
- 7 digits
3,390,551 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 8.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value3,390,551
Digit count7
Digit sum26
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3,390,551
Distinct prime factors13,390,551
Number of divisors2
Sum of divisors σ(n)3,390,552
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,390,550integers below n that share no factor with it
Carmichael function λ(n)3,390,550the 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,390,5512 in total
Arithmetic
Previous number3,390,550
Next number3,390,552
Double6,781,102
Half1,695,275.5
Square11,495,836,083,601
Cube38,977,218,529,089,454,151
Square root1,841.344888933≈irrational, shown to 9 decimal places
Cube root150.230032239≈
Negation-3,390,551
Reciprocal2.94937313 × 10^-7≈
Representations
Decimal3,390,551
Binary110011101111000101011122 bits
Octal14736127
Hexadecimal33BC57
Base 3620O5Z
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, three hundred and ninety thousand, five hundred and fifty-one
Ordinalthree million, three hundred and ninety thousand, five hundred and fifty-first
Scientific notation3.390551 × 10^6
Engineering notation3.390551 × 10^6
In other bases
Ternary20101020221222base 3; the most digit-efficient integer base after e: 14 digits
Quinary1331444201base 5; one hand: 10 digits
Septenary40550663base 7: 8 digits
Nonary6336858base 9; each digit is two ternary digits: 7 digits
Duodecimal117615bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal113g7bbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal15:41:49:11base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T01011T100T00Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101001100110110101011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001100111011110001010111
Bit length22 bitsto write the magnitude
Set bits14the population count, or Hamming weight
Zero bits8within that length
Bit parityeven14 set bits, so even; 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
Bytes333 bc 57
Gray code1010100110001001111100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001100111011110001010111
64-bit0000000000000000000000000000000000000000001100111011110001010111
One's complement11111111110011000100001110101000at 32 bits, every bit flipped
Bits reversed11101010001111011100110000000000at 32 bits
Rotated left by 100000000011001110111100010101110at 32 bits, wrapping
Shifted left by 111001110111100010101110= 6,781,102, no wrap
Shifted right by 1110011101111000101011= 1,695,275, discarding the low bit
These bits as a double1.67515477 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,390,551 to the power 211,495,836,083,601
3,390,551 to the power 338,977,218,529,089,454,151
3,390,551 to the power 4132,154,247,261,022,777,861,127,201
3,390,551 to the power 5448,075,715,205,108,040,499,822,692,477,751
First ten multiples3,390,551, 6,781,102, 10,171,653, 13,562,204, 16,952,755, 20,343,306, 23,733,857, 27,124,408, 30,514,959, 33,905,510
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 2
Divisible by 4No, remainder 3
Divisible by 5No, remainder 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 3
Divisible by 8No, remainder 7
Divisible by 9No, remainder 8
Divisible by 10No, remainder 1
Divisible by 11No, remainder 10
Divisible by 12No, remainder 11
Divisible by 100No, remainder 51
Collatz (3n + 1) trajectory
Steps to reach 184the total stopping time
Highest value reached22,886,2246× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,390,551 → 10,171,654 → 5,085,827 → 15,257,482 → 7,628,741 → 22,886,224 → 11,443,112 → 5,721,556 → 2,860,778 → 1,430,389 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage339,055,100%
3,390,551% as a decimal33,905.51
3,390,551% of 1003,390,551
3,390,551% of 1,00033,905,510
As a fraction of 1003,390,551/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,390,551
Nerdulate something else
Nothing in mind? Surprise me · today’s page