Recognised as Number
3,438,933
- Positive
- Odd
- Composite
- 7 digits
3,438,933 is an odd 7-digit integer and a composite number. It has 8 divisors and a digital root of 6.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,438,933
Digit count7
Digit sum33
Digit product23,328
Multiplicative persistence5times 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 × 59 × 19,429
Distinct prime factors33, 59, 19,429
Number of divisors8
Sum of divisors σ(n)4,663,200
Aliquot sum1,224,267sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,253,648integers below n that share no factor with it
Carmichael function λ(n)563,412the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,253,648
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 3, 59, 177, 19,429, 58,287, 1,146,311, 3,438,9338 in total
Arithmetic
Previous number3,438,932
Next number3,438,934
Double6,877,866
Half1,719,466.5
Square11,826,260,178,489
Cube40,669,716,394,391,712,237
Square root1,854.436032868≈irrational, shown to 9 decimal places
Cube root150.941237021≈
Negation-3,438,933
Reciprocal2.90787869 × 10^-7≈
Representations
Decimal3,438,933
Binary110100011110010101010122 bits
Octal15074525
Hexadecimal347955
Base 3621PHX
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, four hundred and thirty-eight thousand, nine hundred and thirty-three
Ordinalthree million, four hundred and thirty-eight thousand, nine hundred and thirty-third
Scientific notation3.438933 × 10^6
Engineering notation3.438933 × 10^6
In other bases
Ternary20110201022220base 3; the most digit-efficient integer base after e: 14 digits
Quinary1340021213base 5; one hand: 10 digits
Septenary41142021base 7: 8 digits
Nonary6421286base 9; each digit is two ternary digits: 7 digits
Duodecimal119a159base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal119h6dbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal15:55:15:33base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T0111T011000T0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101011000100101010101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001101000111100101010101
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 odd
Highest set bitbit 21worth 2,097,152
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes334 79 55
Gray code1011100100010111111111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001101000111100101010101
64-bit0000000000000000000000000000000000000000001101000111100101010101
One's complement11111111110010111000011010101010at 32 bits, every bit flipped
Bits reversed10101010100111100010110000000000at 32 bits
Rotated left by 100000000011010001111001010101010at 32 bits, wrapping
Shifted left by 111010001111001010101010= 6,877,866, no wrap
Shifted right by 1110100011110010101010= 1,719,466, discarding the low bit
These bits as a double1.69905865 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,438,933 to the power 211,826,260,178,489
3,438,933 to the power 340,669,716,394,391,712,237
3,438,933 to the power 4139,860,429,809,314,674,138,323,121
3,438,933 to the power 5480,970,647,465,435,940,278,525,945,469,893
First ten multiples3,438,933, 6,877,866, 10,316,799, 13,755,732, 17,194,665, 20,633,598, 24,072,531, 27,511,464, 30,950,397, 34,389,330
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 1
Divisible by 5No, remainder 3
Divisible by 6No, remainder 3
Divisible by 7No, remainder 1
Divisible by 8No, remainder 5
Divisible by 9No, remainder 6
Divisible by 10No, remainder 3
Divisible by 11No, remainder 3
Divisible by 12No, remainder 9
Divisible by 100No, remainder 33
Collatz (3n + 1) trajectory
Steps to reach 1102the total stopping time
Highest value reached10,316,8003× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,438,933 → 10,316,800 → 5,158,400 → 2,579,200 → 1,289,600 → 644,800 → 322,400 → 161,200 → 80,600 → 40,300 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage343,893,300%
3,438,933% as a decimal34,389.33
3,438,933% of 1003,438,933
3,438,933% of 1,00034,389,330
As a fraction of 1003,438,933/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,438,933
Nerdulate something else
Nothing in mind? Surprise me · today’s page