Recognised as Number
3,673,393
- Positive
- Odd
- Prime
- 7 digits
3,673,393 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value3,673,393
Digit count7
Digit sum34
Digit product30,618
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3,673,393
Distinct prime factors13,673,393
Number of divisors2
Sum of divisors σ(n)3,673,394
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,673,392integers below n that share no factor with it
Carmichael function λ(n)3,673,392the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)−11 distinct prime factor, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 3,673,3932 in total
Arithmetic
Previous number3,673,392
Next number3,673,394
Double7,346,786
Half1,836,696.5
Square13,493,816,132,449
Cube49,568,089,724,225,229,457
Square root1,916.609767271≈irrational, shown to 9 decimal places
Cube root154.296401662≈
Negation-3,673,393
Reciprocal2.72227883 × 10^-7≈
Representations
Decimal3,673,393
Binary111000000011010011000122 bits
Octal16006461
Hexadecimal380D31
Base 3626QEP
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, six hundred and seventy-three thousand, three hundred and ninety-three
Ordinalthree million, six hundred and seventy-three thousand, three hundred and ninety-third
Scientific notation3.673393 × 10^6
Engineering notation3.673393 × 10^6
In other bases
Ternary20220121221121base 3; the most digit-efficient integer base after e: 14 digits
Quinary1420022033base 5; one hand: 10 digits
Septenary43136413base 7: 8 digits
Nonary6817847base 9; each digit is two ternary digits: 7 digits
Duodecimal1291981base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal12j39dbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal17:0:23:13base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T10T1T0T00TTT1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10010000001110101110001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001110000000110100110001
Bit length22 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits13within that length
Bit parityodd9 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
Bytes338 0d 31
Gray code1001000000101110101001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001110000000110100110001
64-bit0000000000000000000000000000000000000000001110000000110100110001
One's complement11111111110001111111001011001110at 32 bits, every bit flipped
Bits reversed10001100101100000001110000000000at 32 bits
Rotated left by 100000000011100000001101001100010at 32 bits, wrapping
Shifted left by 111100000001101001100010= 7,346,786, no wrap
Shifted right by 1111000000011010011000= 1,836,696, discarding the low bit
These bits as a double1.81489728 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,673,393 to the power 213,493,816,132,449
3,673,393 to the power 349,568,089,724,225,229,457
3,673,393 to the power 4182,083,073,816,340,888,310,737,601
3,673,393 to the power 5668,862,688,775,429,904,734,445,328,350,193
First ten multiples3,673,393, 7,346,786, 11,020,179, 14,693,572, 18,366,965, 22,040,358, 25,713,751, 29,387,144, 33,060,537, 36,733,930
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 5No, remainder 3
Divisible by 6No, remainder 1
Divisible by 7No, remainder 3
Divisible by 8No, remainder 1
Divisible by 9No, remainder 7
Divisible by 10No, remainder 3
Divisible by 11No, remainder 9
Divisible by 12No, remainder 1
Divisible by 100No, remainder 93
Collatz (3n + 1) trajectory
Steps to reach 1172the total stopping time
Highest value reached11,020,1803× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,673,393 → 11,020,180 → 5,510,090 → 2,755,045 → 8,265,136 → 4,132,568 → 2,066,284 → 1,033,142 → 516,571 → 1,549,714 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage367,339,300%
3,673,393% as a decimal36,733.93
3,673,393% of 1003,673,393
3,673,393% of 1,00036,733,930
As a fraction of 1003,673,393/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,673,393
Nerdulate something else
Nothing in mind? Surprise me · today’s page