Recognised as Number
3,790,557
- Positive
- Odd
- Composite
- 7 digits
3,790,557 is an odd 7-digit integer and a composite number. It has 24 divisors and a digital root of 9.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,790,557
Digit count7
Digit sum36
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3^5 × 19 × 821
Distinct prime factors33, 19, 821
Number of divisors24
Sum of divisors σ(n)5,984,160
Aliquot sum2,193,603sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,391,120integers below n that share no factor with it
Carmichael function λ(n)66,420the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,391,120
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 3, 9, 19, 27, 57, 81, 171, 243, 513, 821, 1,539, 2,463, 4,617, 7,389, 15,599, 22,167, 46,797, 66,501, 140,391, 199,503, 421,173, 1,263,519, 3,790,55724 in total
Arithmetic
Previous number3,790,556
Next number3,790,558
Double7,581,114
Half1,895,278.5
Square14,368,322,370,249
Cube54,463,944,938,803,938,693
Square root1,946.935283978≈irrational, shown to 9 decimal places
Cube root155.919707201≈
Negation-3,790,557
Reciprocal2.63813471 × 10^-7≈
Representations
Decimal3,790,557
Binary111001110101101101110122 bits
Octal16353335
Hexadecimal39D6DD
Base 36298T9
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, seven hundred and ninety thousand, five hundred and fifty-seven
Ordinalthree million, seven hundred and ninety thousand, five hundred and fifty-seventh
Scientific notation3.790557 × 10^6
Engineering notation3.790557 × 10^6
In other bases
Ternary21010120200000base 3; the most digit-efficient integer base after e: 14 digits
Quinary1432244212base 5; one hand: 10 digits
Septenary44135121base 7: 8 digits
Nonary7116600base 9; each digit is two ternary digits: 7 digits
Duodecimal1329739base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal13dg7hbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal17:32:55:57base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1011TT1T00000digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10011100010101100101101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001110011101011011011101
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
Bytes339 d6 dd
Gray code1001010011110110110011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001110011101011011011101
64-bit0000000000000000000000000000000000000000001110011101011011011101
One's complement11111111110001100010100100100010at 32 bits, every bit flipped
Bits reversed10111011011010111001110000000000at 32 bits
Rotated left by 100000000011100111010110110111010at 32 bits, wrapping
Shifted left by 111100111010110110111010= 7,581,114, no wrap
Shifted right by 1111001110101101101110= 1,895,278, discarding the low bit
These bits as a double1.87278399 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,790,557 to the power 214,368,322,370,249
3,790,557 to the power 354,463,944,938,803,938,693
3,790,557 to the power 4206,448,687,735,397,841,440,322,001
3,790,557 to the power 5782,555,518,436,226,435,656,502,643,144,557
First ten multiples3,790,557, 7,581,114, 11,371,671, 15,162,228, 18,952,785, 22,743,342, 26,533,899, 30,324,456, 34,115,013, 37,905,570
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 2
Divisible by 6No, remainder 3
Divisible by 7No, remainder 1
Divisible by 8No, remainder 5
Divisible by 9Yes
Divisible by 10No, remainder 7
Divisible by 11No, remainder 1
Divisible by 12No, remainder 9
Divisible by 100No, remainder 57
Collatz (3n + 1) trajectory
Steps to reach 1234the total stopping time
Highest value reached11,371,6723× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,790,557 → 11,371,672 → 5,685,836 → 2,842,918 → 1,421,459 → 4,264,378 → 2,132,189 → 6,396,568 → 3,198,284 → 1,599,142 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage379,055,700%
3,790,557% as a decimal37,905.57
3,790,557% of 1003,790,557
3,790,557% of 1,00037,905,570
As a fraction of 1003,790,557/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,790,557
Nerdulate something else
Nothing in mind? Surprise me · today’s page