Recognised as Number
2,401,281
- Positive
- Odd
- Composite
- 7 digits
2,401,281 is an odd 7-digit integer and a composite number. It has 12 divisors and a digital root of 9.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value2,401,281
Digit count7
Digit sum18
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^2 × 367 × 727
Distinct prime factors33, 367, 727
Number of divisors12
Sum of divisors σ(n)3,482,752
Aliquot sum1,081,471sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,594,296integers below n that share no factor with it
Carmichael function λ(n)44,286the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,594,296
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 3, 9, 367, 727, 1,101, 2,181, 3,303, 6,543, 266,809, 800,427, 2,401,28112 in total
Arithmetic
Previous number2,401,280
Next number2,401,282
Double4,802,562
Half1,200,640.5
Square5,766,150,440,961
Cube13,846,147,497,021,271,041
Square root1,549.606724301≈irrational, shown to 9 decimal places
Cube root133.910406435≈
Negation-2,401,281
Reciprocal4.16444389 × 10^-7≈
Representations
Decimal2,401,281
Binary100100101001000000000122 bits
Octal11122001
Hexadecimal24A401
Base 361FGU9
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, four hundred and one thousand, two hundred and eighty-one
Ordinaltwo million, four hundred and one thousand, two hundred and eighty-first
Scientific notation2.401281 × 10^6
Engineering notation2.401281 × 10^6
In other bases
Ternary11111222221100base 3; the most digit-efficient integer base after e: 14 digits
Quinary1103320111base 5; one hand: 10 digits
Septenary26260551base 7: 8 digits
Nonary4458840base 9; each digit is two ternary digits: 7 digits
Duodecimal979769base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimalf0341base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal11:7:1:21base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1TTTTT0000T1100digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11001011110010000000001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001001001010010000000001
Bit length22 bitsto write the magnitude
Set bits6the population count, or Hamming weight
Zero bits16within that length
Bit parityeven6 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 01
Gray code1101101111011000000001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001001001010010000000001
64-bit0000000000000000000000000000000000000000001001001010010000000001
One's complement11111111110110110101101111111110at 32 bits, every bit flipped
Bits reversed10000000001001010010010000000000at 32 bits
Rotated left by 100000000010010010100100000000010at 32 bits, wrapping
Shifted left by 110010010100100000000010= 4,802,562, no wrap
Shifted right by 1100100101001000000000= 1,200,640, discarding the low bit
These bits as a double1.18639045 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,401,281 to the power 25,766,150,440,961
2,401,281 to the power 313,846,147,497,021,271,041
2,401,281 to the power 433,248,490,907,794,734,746,603,521
2,401,281 to the power 579,838,969,495,560,248,447,058,849,510,401
First ten multiples2,401,281, 4,802,562, 7,203,843, 9,605,124, 12,006,405, 14,407,686, 16,808,967, 19,210,248, 21,611,529, 24,012,810
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 1
Divisible by 8No, remainder 1
Divisible by 9Yes
Divisible by 10No, remainder 1
Divisible by 11No, remainder 3
Divisible by 12No, remainder 9
Divisible by 100No, remainder 81
Collatz (3n + 1) trajectory
Steps to reach 1236the total stopping time
Highest value reached7,203,8443× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,401,281 → 7,203,844 → 3,601,922 → 1,800,961 → 5,402,884 → 2,701,442 → 1,350,721 → 4,052,164 → 2,026,082 → 1,013,041 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage240,128,100%
2,401,281% as a decimal24,012.81
2,401,281% of 1002,401,281
2,401,281% of 1,00024,012,810
As a fraction of 1002,401,281/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,281
Nerdulate something else
Nothing in mind? Surprise me · today’s page