Number
4,013,391
- Positive
- Odd
- Composite
- 7 digits
4,013,391 is an odd 7-digit integer and a composite number. It has 8 divisors and a digital root of 3.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value4,013,391
Digit count7
Digit sum21
Digital root3repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3 × 157 × 8,521
Distinct prime factors33, 157, 8,521
Number of divisors8
Sum of divisors σ(n)5,385,904
Aliquot sum1,372,513sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,658,240integers below n that share no factor with it
SquarefreeYesno repeated prime factor
All divisors1, 3, 157, 471, 8,521, 25,563, 1,337,797, 4,013,3918 in total
Arithmetic
Previous number4,013,390
Next number4,013,392
Double8,026,782
Half2,006,695.5
Square16,107,307,318,881
Cube64,644,922,227,831,135,471
Square root2,003.344952823≈irrational, shown to 9 decimal places
Cube root158.917048618≈
Negation-4,013,391
Reciprocal2.49165855 × 10^-7≈
Representations
Decimal4,013,391
Binary111101001111010100111122 bits
Octal17236517
Hexadecimal3D3D4F
Base 362E0R3
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfour million, thirteen thousand, three hundred and ninety-one
Ordinalfour million, thirteen thousand, three hundred and ninety-first
Scientific notation4.013391 × 10^6
Engineering notation4.013391 × 10^6
Nearest landmarks
Powers & multiples
4,013,391 to the power 216,107,307,318,881
4,013,391 to the power 364,644,922,227,831,135,471
4,013,391 to the power 4259,445,349,064,877,428,619,092,161
4,013,391 to the power 51,041,255,628,928,837,488,123,006,907,127,951
First ten multiples4,013,391, 8,026,782, 12,040,173, 16,053,564, 20,066,955, 24,080,346, 28,093,737, 32,107,128, 36,120,519, 40,133,910
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 3
Divisible by 5No, remainder 1
Divisible by 6No, remainder 3
Divisible by 7No, remainder 4
Divisible by 8No, remainder 7
Divisible by 9No, remainder 3
Divisible by 10No, remainder 1
Divisible by 11No, remainder 8
Divisible by 12No, remainder 3
Divisible by 100No, remainder 91
Collatz (3n + 1) trajectory
Steps to reach 1167the total stopping time
Highest value reached40,635,59210× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps4,013,391 → 12,040,174 → 6,020,087 → 18,060,262 → 9,030,131 → 27,090,394 → 13,545,197 → 40,635,592 → 20,317,796 → 10,158,898 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage401,339,100%
4,013,391% as a decimal40,133.91
4,013,391% of 1004,013,391
4,013,391% of 1,00040,133,910
As a fraction of 1004,013,391/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 4,013,391
Nerdulate something else
Nothing in mind? Surprise me · today’s page