Recognised as Number
3,754,117
- Positive
- Odd
- Prime
- 7 digits
3,754,117 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value3,754,117
Digit count7
Digit sum28
Digit product2,940
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3,754,117
Distinct prime factors13,754,117
Number of divisors2
Sum of divisors σ(n)3,754,118
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,754,116integers below n that share no factor with it
Carmichael function λ(n)3,754,116the 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,754,1172 in total
Arithmetic
Previous number3,754,116
Next number3,754,118
Double7,508,234
Half1,877,058.5
Square14,093,394,449,689
Cube52,908,251,691,283,119,613
Square root1,937.554386333≈irrational, shown to 9 decimal places
Cube root155.418459954≈
Negation-3,754,117
Reciprocal2.66374223 × 10^-7≈
Representations
Decimal3,754,117
Binary111001010010001000010122 bits
Octal16244205
Hexadecimal394885
Base 3628GP1
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, seven hundred and fifty-four thousand, one hundred and seventeen
Ordinalthree million, seven hundred and fifty-four thousand, one hundred and seventeenth
Scientific notation3.754117 × 10^6
Engineering notation3.754117 × 10^6
In other bases
Ternary21001201200101base 3; the most digit-efficient integer base after e: 14 digits
Quinary1430112432base 5; one hand: 10 digits
Septenary43623643base 7: 8 digits
Nonary7051611base 9; each digit is two ternary digits: 7 digits
Duodecimal1310631base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal13955hbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal17:22:48:37base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T101TT1TT00101digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10010010101100110000101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001110010100100010000101
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
Bytes339 48 85
Gray code1001011110110011000111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001110010100100010000101
64-bit0000000000000000000000000000000000000000001110010100100010000101
One's complement11111111110001101011011101111010at 32 bits, every bit flipped
Bits reversed10100001000100101001110000000000at 32 bits
Rotated left by 100000000011100101001000100001010at 32 bits, wrapping
Shifted left by 111100101001000100001010= 7,508,234, no wrap
Shifted right by 1111001010010001000010= 1,877,058, discarding the low bit
These bits as a double1.85478024 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,754,117 to the power 214,093,394,449,689
3,754,117 to the power 352,908,251,691,283,119,613
3,754,117 to the power 4198,623,767,114,524,711,152,196,721
3,754,117 to the power 5745,656,860,728,678,165,056,551,297,650,357
First ten multiples3,754,117, 7,508,234, 11,262,351, 15,016,468, 18,770,585, 22,524,702, 26,278,819, 30,032,936, 33,787,053, 37,541,170
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 2
Divisible by 6No, remainder 1
Divisible by 7No, remainder 3
Divisible by 8No, remainder 5
Divisible by 9No, remainder 1
Divisible by 10No, remainder 7
Divisible by 11No, remainder 4
Divisible by 12No, remainder 1
Divisible by 100No, remainder 17
Collatz (3n + 1) trajectory
Steps to reach 1247the total stopping time
Highest value reached20,853,0165× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,754,117 → 11,262,352 → 5,631,176 → 2,815,588 → 1,407,794 → 703,897 → 2,111,692 → 1,055,846 → 527,923 → 1,583,770 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage375,411,700%
3,754,117% as a decimal37,541.17
3,754,117% of 1003,754,117
3,754,117% of 1,00037,541,170
As a fraction of 1003,754,117/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,754,117
Nerdulate something else
Nothing in mind? Surprise me · today’s page