Recognised as Number
3,731,969
- Positive
- Odd
- Prime
- 7 digits
3,731,969 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 2.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value3,731,969
Digit count7
Digit sum38
Digit product30,618
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3,731,969
Distinct prime factors13,731,969
Number of divisors2
Sum of divisors σ(n)3,731,970
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,731,968integers below n that share no factor with it
Carmichael function λ(n)3,731,968the 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,731,9692 in total
Arithmetic
Previous number3,731,968
Next number3,731,970
Double7,463,938
Half1,865,984.5
Square13,927,592,616,961
Cube51,977,343,891,127,326,209
Square root1,931.830479105≈irrational, shown to 9 decimal places
Cube root155.112218423≈
Negation-3,731,969
Reciprocal2.67955066 × 10^-7≈
Representations
Decimal3,731,969
Binary111000111100100000000122 bits
Octal16171001
Hexadecimal38F201
Base 3627ZLT
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, seven hundred and thirty-one thousand, nine hundred and sixty-nine
Ordinalthree million, seven hundred and thirty-one thousand, nine hundred and sixty-ninth
Scientific notation3.731969 × 10^6
Engineering notation3.731969 × 10^6
In other bases
Ternary21000121022002base 3; the most digit-efficient integer base after e: 14 digits
Quinary1423410334base 5; one hand: 10 digits
Septenary43502243base 7: 8 digits
Nonary7017262base 9; each digit is two ternary digits: 7 digits
Duodecimal12bb855base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal1369i9base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal17:16:39:29base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1001TT110T01Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10010010011011000000001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001110001111001000000001
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 f2 01
Gray code1001001000101100000001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001110001111001000000001
64-bit0000000000000000000000000000000000000000001110001111001000000001
One's complement11111111110001110000110111111110at 32 bits, every bit flipped
Bits reversed10000000010011110001110000000000at 32 bits
Rotated left by 100000000011100011110010000000010at 32 bits, wrapping
Shifted left by 111100011110010000000010= 7,463,938, no wrap
Shifted right by 1111000111100100000000= 1,865,984, discarding the low bit
These bits as a double1.84383767 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,731,969 to the power 213,927,592,616,961
3,731,969 to the power 351,977,343,891,127,326,209
3,731,969 to the power 4193,977,836,104,026,556,464,875,521
3,731,969 to the power 5723,919,271,027,307,883,903,665,033,230,849
First ten multiples3,731,969, 7,463,938, 11,195,907, 14,927,876, 18,659,845, 22,391,814, 26,123,783, 29,855,752, 33,587,721, 37,319,690
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 2
Divisible by 4No, remainder 1
Divisible by 5No, remainder 4
Divisible by 6No, remainder 5
Divisible by 7No, remainder 3
Divisible by 8No, remainder 1
Divisible by 9No, remainder 2
Divisible by 10No, remainder 9
Divisible by 11No, remainder 10
Divisible by 12No, remainder 5
Divisible by 100No, remainder 69
Collatz (3n + 1) trajectory
Steps to reach 1110the total stopping time
Highest value reached11,195,9083× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,731,969 → 11,195,908 → 5,597,954 → 2,798,977 → 8,396,932 → 4,198,466 → 2,099,233 → 6,297,700 → 3,148,850 → 1,574,425 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage373,196,900%
3,731,969% as a decimal37,319.69
3,731,969% of 1003,731,969
3,731,969% of 1,00037,319,690
As a fraction of 1003,731,969/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,731,969
Nerdulate something else
Nothing in mind? Surprise me · today’s page