Recognised as Number
3,474,331
- Positive
- Odd
- Composite
- 7 digits
3,474,331 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,474,331
Digit count7
Digit sum25
Digit product3,024
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation7 × 496,333
Distinct prime factors27, 496,333
Number of divisors4
Sum of divisors σ(n)3,970,672
Aliquot sum496,341sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,977,992integers below n that share no factor with it
Carmichael function λ(n)496,332the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,977,992
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 7, 496,333, 3,474,3314 in total
Arithmetic
Previous number3,474,330
Next number3,474,332
Double6,948,662
Half1,737,165.5
Square12,070,975,897,561
Cube41,938,565,761,149,006,691
Square root1,863.955739818≈irrational, shown to 9 decimal places
Cube root151.457365094≈
Negation-3,474,331
Reciprocal2.87825196 × 10^-7≈
Representations
Decimal3,474,331
Binary110101000000111001101122 bits
Octal15201633
Hexadecimal35039B
Base 3622GT7
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, four hundred and seventy-four thousand, three hundred and thirty-one
Ordinalthree million, four hundred and seventy-four thousand, three hundred and thirty-first
Scientific notation3.474331 × 10^6
Engineering notation3.474331 × 10^6
In other bases
Ternary20112111212221base 3; the most digit-efficient integer base after e: 14 digits
Quinary1342134311base 5; one hand: 10 digits
Septenary41350150base 7: 8 digits
Nonary6474787base 9; each digit is two ternary digits: 7 digits
Duodecimal11b6737base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal11e5gbbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal16:5:5:31base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1TT0TTT0T00T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101010000010011101111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001101010000001110011011
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 03 9b
Gray code1011111000001001010110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001101010000001110011011
64-bit0000000000000000000000000000000000000000001101010000001110011011
One's complement11111111110010101111110001100100at 32 bits, every bit flipped
Bits reversed11011001110000001010110000000000at 32 bits
Rotated left by 100000000011010100000011100110110at 32 bits, wrapping
Shifted left by 111010100000011100110110= 6,948,662, no wrap
Shifted right by 1110101000000111001101= 1,737,165, discarding the low bit
These bits as a double1.71654759 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,474,331 to the power 212,070,975,897,561
3,474,331 to the power 341,938,565,761,149,006,691
3,474,331 to the power 4145,708,459,119,498,589,565,748,721
3,474,331 to the power 5506,239,416,481,106,654,184,557,319,580,651
First ten multiples3,474,331, 6,948,662, 10,422,993, 13,897,324, 17,371,655, 20,845,986, 24,320,317, 27,794,648, 31,268,979, 34,743,310
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 3
Divisible by 5No, remainder 1
Divisible by 6No, remainder 1
Divisible by 7Yes
Divisible by 8No, remainder 3
Divisible by 9No, remainder 7
Divisible by 10No, remainder 1
Divisible by 11No, remainder 3
Divisible by 12No, remainder 7
Divisible by 100No, remainder 31
Collatz (3n + 1) trajectory
Steps to reach 1221the total stopping time
Highest value reached39,574,81611× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,474,331 → 10,422,994 → 5,211,497 → 15,634,492 → 7,817,246 → 3,908,623 → 11,725,870 → 5,862,935 → 17,588,806 → 8,794,403 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage347,433,100%
3,474,331% as a decimal34,743.31
3,474,331% of 1003,474,331
3,474,331% of 1,00034,743,310
As a fraction of 1003,474,331/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,474,331
Nerdulate something else
Nothing in mind? Surprise me · today’s page