Recognised as Number
3,374,905
- Positive
- Odd
- Composite
- 7 digits
3,374,905 is an odd 7-digit integer and a composite number. It has 8 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,374,905
Digit count7
Digit sum31
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation5 × 23 × 29,347
Distinct prime factors35, 23, 29,347
Number of divisors8
Sum of divisors σ(n)4,226,112
Aliquot sum851,207sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,582,448integers below n that share no factor with it
Carmichael function λ(n)645,612the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,582,448
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 5, 23, 115, 29,347, 146,735, 674,981, 3,374,9058 in total
Arithmetic
Previous number3,374,904
Next number3,374,906
Double6,749,810
Half1,687,452.5
Square11,389,983,759,025
Cube38,440,113,138,252,267,625
Square root1,837.09145118≈irrational, shown to 9 decimal places
Cube root149.998592579≈
Negation-3,374,905
Reciprocal2.96304637 × 10^-7≈
Representations
Decimal3,374,905
Binary110011011111110011100122 bits
Octal14677471
Hexadecimal337F39
Base 3620C3D
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, three hundred and seventy-four thousand, nine hundred and five
Ordinalthree million, three hundred and seventy-four thousand, nine hundred and fifth
Scientific notation3.374905 × 10^6
Engineering notation3.374905 × 10^6
In other bases
Ternary20100110111111base 3; the most digit-efficient integer base after e: 14 digits
Quinary1330444110base 5; one hand: 10 digits
Septenary40454242base 7: 8 digits
Nonary6313444base 9; each digit is two ternary digits: 7 digits
Duodecimal11690a1base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal111h55base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal15:37:28:25base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T0100110111111digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101001000001101001001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001100110111111100111001
Bit length22 bitsto write the magnitude
Set bits15the population count, or Hamming weight
Zero bits7within that length
Bit parityodd15 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 7f 39
Gray code1010101100000010100101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001100110111111100111001
64-bit0000000000000000000000000000000000000000001100110111111100111001
One's complement11111111110011001000000011000110at 32 bits, every bit flipped
Bits reversed10011100111111101100110000000000at 32 bits
Rotated left by 100000000011001101111111001110010at 32 bits, wrapping
Shifted left by 111001101111111001110010= 6,749,810, no wrap
Shifted right by 1110011011111110011100= 1,687,452, discarding the low bit
These bits as a double1.66742462 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,374,905 to the power 211,389,983,759,025
3,374,905 to the power 338,440,113,138,252,267,625
3,374,905 to the power 4129,731,730,030,853,269,268,950,625
3,374,905 to the power 5437,832,264,339,776,852,722,127,809,065,625
First ten multiples3,374,905, 6,749,810, 10,124,715, 13,499,620, 16,874,525, 20,249,430, 23,624,335, 26,999,240, 30,374,145, 33,749,050
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 5Yes
Divisible by 6No, remainder 1
Divisible by 7No, remainder 2
Divisible by 8No, remainder 1
Divisible by 9No, remainder 4
Divisible by 10No, remainder 5
Divisible by 11No, remainder 6
Divisible by 12No, remainder 1
Divisible by 100No, remainder 5
Collatz (3n + 1) trajectory
Steps to reach 1107the total stopping time
Highest value reached11,390,3083× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,374,905 → 10,124,716 → 5,062,358 → 2,531,179 → 7,593,538 → 3,796,769 → 11,390,308 → 5,695,154 → 2,847,577 → 8,542,732 → …
Last steps… → 32 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage337,490,500%
3,374,905% as a decimal33,749.05
3,374,905% of 1003,374,905
3,374,905% of 1,00033,749,050
As a fraction of 1003,374,905/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,374,905
Nerdulate something else
Nothing in mind? Surprise me · today’s page