Recognised as Number
3,482,492
- Positive
- Even
- Composite
- 7 digits
3,482,492 is an even 7-digit integer and a composite number. It has 24 divisors and a digital root of 5.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value3,482,492
Digit count7
Digit sum32
Digit product13,824
Multiplicative persistence4times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2^2 × 13 × 193 × 347
Distinct prime factors42, 13, 193, 347
Number of divisors24
Sum of divisors σ(n)6,616,176
Aliquot sum3,133,684sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,594,368integers below n that share no factor with it
Carmichael function λ(n)33,216the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,594,368
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 13, 26, 52, 193, 347, 386, 694, 772, 1,388, 2,509, 4,511, 5,018, 9,022, 10,036, 18,044, 66,971, 133,942, 267,884, 870,623, 1,741,246, 3,482,49224 in total
Arithmetic
Previous number3,482,491
Next number3,482,493
Double6,964,984
Half1,741,246
Square12,127,750,530,064
Cube42,234,794,198,943,639,488
Square root1,866.143617196≈irrational, shown to 9 decimal places
Cube root151.575860522≈
Negation-3,482,492
Reciprocal2.87150696 × 10^-7≈
Representations
Decimal3,482,492
Binary110101001000110111110022 bits
Octal15221574
Hexadecimal35237C
Base 3622N3W
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, four hundred and eighty-two thousand, four hundred and ninety-two
Ordinalthree million, four hundred and eighty-two thousand, four hundred and ninety-second
Scientific notation3.482492 × 10^6
Engineering notation3.482492 × 10^6
In other bases
Ternary20112221002012base 3; the most digit-efficient integer base after e: 14 digits
Quinary1342414432base 5; one hand: 10 digits
Septenary41413016base 7: 8 digits
Nonary6487065base 9; each digit is two ternary digits: 7 digits
Duodecimal11bb3b8base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal11f64cbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal16:7:21:32base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1TT00T101T1TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101010110010010001100base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001101010010001101111100
Bit length22 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits10within that length
Bit parityeven12 set bits, so even; not the same as the number itself being even
Highest set bitbit 21worth 2,097,152
Lowest set bitbit 22 trailing zeros
Power of twoNo
Bytes335 23 7c
Gray code1011111011001011000010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001101010010001101111100
64-bit0000000000000000000000000000000000000000001101010010001101111100
One's complement11111111110010101101110010000011at 32 bits, every bit flipped
Bits reversed00111110110001001010110000000000at 32 bits
Rotated left by 100000000011010100100011011111000at 32 bits, wrapping
Shifted left by 111010100100011011111000= 6,964,984, no wrap
Shifted right by 1110101001000110111110= 1,741,246, discarding the low bit
These bits as a double1.72057966 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,482,492 to the power 212,127,750,530,064
3,482,492 to the power 342,234,794,198,943,639,488
3,482,492 to the power 4147,082,332,919,467,632,967,844,096
3,482,492 to the power 5512,213,047,733,382,676,069,453,321,567,232
First ten multiples3,482,492, 6,964,984, 10,447,476, 13,929,968, 17,412,460, 20,894,952, 24,377,444, 27,859,936, 31,342,428, 34,824,920
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 2
Divisible by 4Yes
Divisible by 5No, remainder 2
Divisible by 6No, remainder 2
Divisible by 7No, remainder 6
Divisible by 8No, remainder 4
Divisible by 9No, remainder 5
Divisible by 10No, remainder 2
Divisible by 11No, remainder 2
Divisible by 12No, remainder 8
Divisible by 100No, remainder 92
Collatz (3n + 1) trajectory
Steps to reach 1128the total stopping time
Highest value reached13,222,6003× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,482,492 → 1,741,246 → 870,623 → 2,611,870 → 1,305,935 → 3,917,806 → 1,958,903 → 5,876,710 → 2,938,355 → 8,815,066 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage348,249,200%
3,482,492% as a decimal34,824.92
3,482,492% of 1003,482,492
3,482,492% of 1,00034,824,920
As a fraction of 1003,482,492/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,482,492
Nerdulate something else
Nothing in mind? Surprise me · today’s page