Recognised as Number
2,401,341
- Positive
- Odd
- Composite
- 7 digits
2,401,341 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 6.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value2,401,341
Digit count7
Digit sum15
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root6repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3 × 800,447
Distinct prime factors23, 800,447
Number of divisors4
Sum of divisors σ(n)3,201,792
Aliquot sum800,451sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,600,892integers below n that share no factor with it
Carmichael function λ(n)800,446the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,600,892
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 3, 800,447, 2,401,3414 in total
Arithmetic
Previous number2,401,340
Next number2,401,342
Double4,802,682
Half1,200,670.5
Square5,766,438,598,281
Cube13,847,185,430,034,694,821
Square root1,549.626083931≈irrational, shown to 9 decimal places
Cube root133.911521751≈
Negation-2,401,341
Reciprocal4.16433984 × 10^-7≈
Representations
Decimal2,401,341
Binary100100101001000011110122 bits
Octal11122075
Hexadecimal24A43D
Base 361FGVX
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, four hundred and one thousand, three hundred and forty-one
Ordinaltwo million, four hundred and one thousand, three hundred and forty-first
Scientific notation2.401341 × 10^6
Engineering notation2.401341 × 10^6
In other bases
Ternary11112000000120base 3; the most digit-efficient integer base after e: 14 digits
Quinary1103320331base 5; one hand: 10 digits
Septenary26260665base 7: 8 digits
Nonary4460016base 9; each digit is two ternary digits: 7 digits
Duodecimal9797b9base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimalf0371base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal11:7:2:21base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1TTTTT000001TT0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11001011110010001001101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001001001010010000111101
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
Bytes324 a4 3d
Gray code1101101111011000100011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001001001010010000111101
64-bit0000000000000000000000000000000000000000001001001010010000111101
One's complement11111111110110110101101111000010at 32 bits, every bit flipped
Bits reversed10111100001001010010010000000000at 32 bits
Rotated left by 100000000010010010100100001111010at 32 bits, wrapping
Shifted left by 110010010100100001111010= 4,802,682, no wrap
Shifted right by 1100100101001000011110= 1,200,670, discarding the low bit
These bits as a double1.18642009 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,401,341 to the power 25,766,438,598,281
2,401,341 to the power 313,847,185,430,034,694,821
2,401,341 to the power 433,251,814,107,744,944,096,154,961
2,401,341 to the power 579,848,944,541,306,351,800,804,850,202,701
First ten multiples2,401,341, 4,802,682, 7,204,023, 9,605,364, 12,006,705, 14,408,046, 16,809,387, 19,210,728, 21,612,069, 24,013,410
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 1
Divisible by 6No, remainder 3
Divisible by 7No, remainder 5
Divisible by 8No, remainder 5
Divisible by 9No, remainder 6
Divisible by 10No, remainder 1
Divisible by 11No, remainder 8
Divisible by 12No, remainder 9
Divisible by 100No, remainder 41
Collatz (3n + 1) trajectory
Steps to reach 1236the total stopping time
Highest value reached17,545,5527× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,401,341 → 7,204,024 → 3,602,012 → 1,801,006 → 900,503 → 2,701,510 → 1,350,755 → 4,052,266 → 2,026,133 → 6,078,400 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage240,134,100%
2,401,341% as a decimal24,013.41
2,401,341% of 1002,401,341
2,401,341% of 1,00024,013,410
As a fraction of 1002,401,341/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 2,401,341
Nerdulate something else
Nothing in mind? Surprise me · today’s page