Recognised as Number
3,762,449
- Positive
- Odd
- Prime
- 7 digits
3,762,449 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 8.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value3,762,449
Digit count7
Digit sum35
Digit product36,288
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3,762,449
Distinct prime factors13,762,449
Number of divisors2
Sum of divisors σ(n)3,762,450
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,762,448integers below n that share no factor with it
Carmichael function λ(n)3,762,448the 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,762,4492 in total
Arithmetic
Previous number3,762,448
Next number3,762,450
Double7,524,898
Half1,881,224.5
Square14,156,022,477,601
Cube53,261,312,614,827,404,849
Square root1,939.703327831≈irrational, shown to 9 decimal places
Cube root155.533355127≈
Negation-3,762,449
Reciprocal2.65784334 × 10^-7≈
Representations
Decimal3,762,449
Binary111001011010010001000122 bits
Octal16264421
Hexadecimal396911
Base 3628N4H
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, seven hundred and sixty-two thousand, four hundred and forty-nine
Ordinalthree million, seven hundred and sixty-two thousand, four hundred and forty-ninth
Scientific notation3.762449 × 10^6
Engineering notation3.762449 × 10^6
In other bases
Ternary21002011002222base 3; the most digit-efficient integer base after e: 14 digits
Quinary1430344244base 5; one hand: 10 digits
Septenary43660145base 7: 8 digits
Nonary7064088base 9; each digit is two ternary digits: 7 digits
Duodecimal1315415base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal13a629base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal17:25:7:29base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T101T01101000Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10011101011100100010001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001110010110100100010001
Bit length22 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits12within that length
Bit parityeven10 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
Bytes339 69 11
Gray code1001011101110110011001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001110010110100100010001
64-bit0000000000000000000000000000000000000000001110010110100100010001
One's complement11111111110001101001011011101110at 32 bits, every bit flipped
Bits reversed10001000100101101001110000000000at 32 bits
Rotated left by 100000000011100101101001000100010at 32 bits, wrapping
Shifted left by 111100101101001000100010= 7,524,898, no wrap
Shifted right by 1111001011010010001000= 1,881,224, discarding the low bit
These bits as a double1.8588968 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,762,449 to the power 214,156,022,477,601
3,762,449 to the power 353,261,312,614,827,404,849
3,762,449 to the power 4200,392,972,386,344,754,546,715,201
3,762,449 to the power 5753,968,338,562,030,435,399,534,061,287,249
First ten multiples3,762,449, 7,524,898, 11,287,347, 15,049,796, 18,812,245, 22,574,694, 26,337,143, 30,099,592, 33,862,041, 37,624,490
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 5
Divisible by 8No, remainder 1
Divisible by 9No, remainder 8
Divisible by 10No, remainder 9
Divisible by 11No, remainder 9
Divisible by 12No, remainder 5
Divisible by 100No, remainder 49
Collatz (3n + 1) trajectory
Steps to reach 1110the total stopping time
Highest value reached11,287,3483× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,762,449 → 11,287,348 → 5,643,674 → 2,821,837 → 8,465,512 → 4,232,756 → 2,116,378 → 1,058,189 → 3,174,568 → 1,587,284 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage376,244,900%
3,762,449% as a decimal37,624.49
3,762,449% of 1003,762,449
3,762,449% of 1,00037,624,490
As a fraction of 1003,762,449/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,762,449
Nerdulate something else
Nothing in mind? Surprise me · today’s page