Recognised as Number
3,486,291
- Positive
- Odd
- Composite
- 7 digits
3,486,291 is an odd 7-digit integer and a composite number. It has 16 divisors and a digital root of 6.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,486,291
Digit count7
Digit sum33
Digit product10,368
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root6repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3 × 19 × 31 × 1,973
Distinct prime factors43, 19, 31, 1,973
Number of divisors16
Sum of divisors σ(n)5,053,440
Aliquot sum1,567,149sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,129,760integers below n that share no factor with it
Carmichael function λ(n)88,740the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,129,760
Möbius function μ(n)+14 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 3, 19, 31, 57, 93, 589, 1,767, 1,973, 5,919, 37,487, 61,163, 112,461, 183,489, 1,162,097, 3,486,29116 in total
Arithmetic
Previous number3,486,290
Next number3,486,292
Double6,972,582
Half1,743,145.5
Square12,154,224,936,681
Cube42,373,165,008,726,540,171
Square root1,867.16121425≈irrational, shown to 9 decimal places
Cube root151.630957794≈
Negation-3,486,291
Reciprocal2.86837788 × 10^-7≈
Representations
Decimal3,486,291
Binary110101001100100101001122 bits
Octal15231123
Hexadecimal353253
Base 3622Q1F
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, four hundred and eighty-six thousand, two hundred and ninety-one
Ordinalthree million, four hundred and eighty-six thousand, two hundred and ninety-first
Scientific notation3.486291 × 10^6
Engineering notation3.486291 × 10^6
In other bases
Ternary20120010021220base 3; the most digit-efficient integer base after e: 14 digits
Quinary1343030131base 5; one hand: 10 digits
Septenary41430054base 7: 8 digits
Nonary6503256base 9; each digit is two ternary digits: 7 digits
Duodecimal1201643base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal11ffebbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal16:8:24:51base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1TT001010T0T0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101010111011001010111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001101010011001001010011
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
Bytes335 32 53
Gray code1011111010101101111010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001101010011001001010011
64-bit0000000000000000000000000000000000000000001101010011001001010011
One's complement11111111110010101100110110101100at 32 bits, every bit flipped
Bits reversed11001010010011001010110000000000at 32 bits
Rotated left by 100000000011010100110010010100110at 32 bits, wrapping
Shifted left by 111010100110010010100110= 6,972,582, no wrap
Shifted right by 1110101001100100101001= 1,743,145, discarding the low bit
These bits as a double1.72245661 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,486,291 to the power 212,154,224,936,681
3,486,291 to the power 342,373,165,008,726,540,171
3,486,291 to the power 4147,725,183,811,438,258,459,295,761
3,486,291 to the power 5515,012,978,795,162,897,522,316,677,912,451
First ten multiples3,486,291, 6,972,582, 10,458,873, 13,945,164, 17,431,455, 20,917,746, 24,404,037, 27,890,328, 31,376,619, 34,862,910
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
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 4
Divisible by 8No, remainder 3
Divisible by 9No, remainder 6
Divisible by 10No, remainder 1
Divisible by 11No, remainder 6
Divisible by 12No, remainder 3
Divisible by 100No, remainder 91
Collatz (3n + 1) trajectory
Steps to reach 1190the total stopping time
Highest value reached19,855,5285× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,486,291 → 10,458,874 → 5,229,437 → 15,688,312 → 7,844,156 → 3,922,078 → 1,961,039 → 5,883,118 → 2,941,559 → 8,824,678 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage348,629,100%
3,486,291% as a decimal34,862.91
3,486,291% of 1003,486,291
3,486,291% of 1,00034,862,910
As a fraction of 1003,486,291/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,486,291
Nerdulate something else
Nothing in mind? Surprise me · today’s page