Number
3,748,363
- Positive
- Odd
- Composite
- 7 digits
3,748,363 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,748,363
Digit count7
Digit sum34
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation83 × 45,161
Distinct prime factors283, 45,161
Number of divisors4
Sum of divisors σ(n)3,793,608
Aliquot sum45,245sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,703,120integers below n that share no factor with it
SquarefreeYesno repeated prime factor
All divisors1, 83, 45,161, 3,748,3634 in total
Arithmetic
Previous number3,748,362
Next number3,748,364
Double7,496,726
Half1,874,181.5
Square14,050,225,179,769
Cube52,665,344,205,514,468,147
Square root1,936.068955384≈irrational, shown to 9 decimal places
Cube root155.339015165≈
Negation-3,748,363
Reciprocal2.66783126 × 10^-7≈
Representations
Decimal3,748,363
Binary111001001100100000101122 bits
Octal16231013
Hexadecimal39320B
Base 3628C97
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, seven hundred and forty-eight thousand, three hundred and sixty-three
Ordinalthree million, seven hundred and forty-eight thousand, three hundred and sixty-third
Scientific notation3.748363 × 10^6
Engineering notation3.748363 × 10^6
Nearest landmarks
Powers & multiples
3,748,363 to the power 214,050,225,179,769
3,748,363 to the power 352,665,344,205,514,468,147
3,748,363 to the power 4197,408,827,602,214,828,366,893,361
3,748,363 to the power 5739,959,945,257,520,780,701,813,499,318,043
First ten multiples3,748,363, 7,496,726, 11,245,089, 14,993,452, 18,741,815, 22,490,178, 26,238,541, 29,986,904, 33,735,267, 37,483,630
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 3
Divisible by 5No, remainder 3
Divisible by 6No, remainder 1
Divisible by 7No, remainder 3
Divisible by 8No, remainder 3
Divisible by 9No, remainder 7
Divisible by 10No, remainder 3
Divisible by 11No, remainder 3
Divisible by 12No, remainder 7
Divisible by 100No, remainder 63
Collatz (3n + 1) trajectory
Steps to reach 1115the total stopping time
Highest value reached16,867,6364× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,748,363 → 11,245,090 → 5,622,545 → 16,867,636 → 8,433,818 → 4,216,909 → 12,650,728 → 6,325,364 → 3,162,682 → 1,581,341 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage374,836,300%
3,748,363% as a decimal37,483.63
3,748,363% of 1003,748,363
3,748,363% of 1,00037,483,630
As a fraction of 1003,748,363/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,748,363
Nerdulate something else
Nothing in mind? Surprise me · today’s page