Recognised as Number
3,390,481
- Positive
- Odd
- Composite
- 7 digits
3,390,481 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,390,481
Digit count7
Digit sum28
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation271 × 12,511
Distinct prime factors2271, 12,511
Number of divisors4
Sum of divisors σ(n)3,403,264
Aliquot sum12,783sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,377,700integers below n that share no factor with it
Carmichael function λ(n)37,530the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 3,377,700
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 271, 12,511, 3,390,4814 in total
Arithmetic
Previous number3,390,480
Next number3,390,482
Double6,780,962
Half1,695,240.5
Square11,495,361,411,361
Cube38,974,804,453,352,654,641
Square root1,841.325880989≈irrational, shown to 9 decimal places
Cube root150.228998369≈
Negation-3,390,481
Reciprocal2.94943402 × 10^-7≈
Representations
Decimal3,390,481
Binary110011101111000001000122 bits
Octal14736021
Hexadecimal33BC11
Base 3620O41
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, three hundred and ninety thousand, four hundred and eighty-one
Ordinalthree million, three hundred and ninety thousand, four hundred and eighty-first
Scientific notation3.390481 × 10^6
Engineering notation3.390481 × 10^6
In other bases
Ternary20101020212101base 3; the most digit-efficient integer base after e: 14 digits
Quinary1331443411base 5; one hand: 10 digits
Septenary40550533base 7: 8 digits
Nonary6336771base 9; each digit is two ternary digits: 7 digits
Duodecimal1176101base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal113g41base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal15:41:48:1base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T01011T10TT101digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101001100110000010001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001100111011110000010001
Bit length22 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits11within that length
Bit parityodd11 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
Bytes333 bc 11
Gray code1010100110001000011001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001100111011110000010001
64-bit0000000000000000000000000000000000000000001100111011110000010001
One's complement11111111110011000100001111101110at 32 bits, every bit flipped
Bits reversed10001000001111011100110000000000at 32 bits
Rotated left by 100000000011001110111100000100010at 32 bits, wrapping
Shifted left by 111001110111100000100010= 6,780,962, no wrap
Shifted right by 1110011101111000001000= 1,695,240, discarding the low bit
These bits as a double1.67512018 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,390,481 to the power 211,495,361,411,361
3,390,481 to the power 338,974,804,453,352,654,641
3,390,481 to the power 4132,143,333,977,807,561,859,872,321
3,390,481 to the power 5448,029,463,128,410,960,142,221,766,776,401
First ten multiples3,390,481, 6,780,962, 10,171,443, 13,561,924, 16,952,405, 20,342,886, 23,733,367, 27,123,848, 30,514,329, 33,904,810
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 1
Divisible by 6No, remainder 1
Divisible by 7No, remainder 3
Divisible by 8No, remainder 1
Divisible by 9No, remainder 1
Divisible by 10No, remainder 1
Divisible by 11No, remainder 6
Divisible by 12No, remainder 1
Divisible by 100No, remainder 81
Collatz (3n + 1) trajectory
Steps to reach 184the total stopping time
Highest value reached10,171,4443× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,390,481 → 10,171,444 → 5,085,722 → 2,542,861 → 7,628,584 → 3,814,292 → 1,907,146 → 953,573 → 2,860,720 → 1,430,360 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage339,048,100%
3,390,481% as a decimal33,904.81
3,390,481% of 1003,390,481
3,390,481% of 1,00033,904,810
As a fraction of 1003,390,481/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,481
Nerdulate something else
Nothing in mind? Surprise me · today’s page