Recognised as Number
7,401,143
- Positive
- Odd
- Prime
- 7 digits
7,401,143 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 2.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value7,401,143
Digit count7
Digit sum20
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation7,401,143
Distinct prime factors17,401,143
Number of divisors2
Sum of divisors σ(n)7,401,144
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)7,401,142integers below n that share no factor with it
Carmichael function λ(n)7,401,142the 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, 7,401,1432 in total
Arithmetic
Previous number7,401,142
Next number7,401,144
Double14,802,286
Half3,700,571.5
Square54,776,917,706,449
Cube405,411,801,044,661,071,207
Square root2,720.504181213≈irrational, shown to 9 decimal places
Cube root194.879548668≈
Negation-7,401,143
Reciprocal1.35114265 × 10^-7≈
Representations
Decimal7,401,143
Binary1110000111011101011011123 bits
Octal34167267
Hexadecimal70EEB7
Base 364EMRB
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsseven million, four hundred and one thousand, one hundred and forty-three
Ordinalseven million, four hundred and one thousand, one hundred and forty-third
Scientific notation7.401143 × 10^6
Engineering notation7.401143 × 10^6
In other bases
Ternary111221000110102base 3; the most digit-efficient integer base after e: 15 digits
Quinary3343314033base 5; one hand: 10 digits
Septenary116623451base 7: 9 digits
Nonary14830412base 9; each digit is two ternary digits: 8 digits
Duodecimal258b09bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal2652h3base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal34:15:52:23base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1TTT0T100011011Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101100010011001111001011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000011100001110111010110111
Bit length23 bitsto write the magnitude
Set bits15the population count, or Hamming weight
Zero bits8within that length
Bit parityodd15 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 22worth 4,194,304
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes370 ee b7
Gray code10010001001100111101100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000011100001110111010110111
64-bit0000000000000000000000000000000000000000011100001110111010110111
One's complement11111111100011110001000101001000at 32 bits, every bit flipped
Bits reversed11101101011101110000111000000000at 32 bits
Rotated left by 100000000111000011101110101101110at 32 bits, wrapping
Shifted left by 1111000011101110101101110= 14,802,286, no wrap
Shifted right by 11110000111011101011011= 3,700,571, discarding the low bit
These bits as a double3.6566505 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
7,401,143 to the power 254,776,917,706,449
7,401,143 to the power 3405,411,801,044,661,071,207
7,401,143 to the power 43,000,510,713,419,085,974,536,189,601
7,401,143 to the power 522,207,208,863,046,674,226,836,697,912,113,943
First ten multiples7,401,143, 14,802,286, 22,203,429, 29,604,572, 37,005,715, 44,406,858, 51,808,001, 59,209,144, 66,610,287, 74,011,430
Powers of twoBetween 2^22 (4,194,304) and 2^23 (8,388,608)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 2
Divisible by 4No, remainder 3
Divisible by 5No, remainder 3
Divisible by 6No, remainder 5
Divisible by 7No, remainder 1
Divisible by 8No, remainder 7
Divisible by 9No, remainder 2
Divisible by 10No, remainder 3
Divisible by 11No, remainder 2
Divisible by 12No, remainder 11
Divisible by 100No, remainder 43
Collatz (3n + 1) trajectory
Steps to reach 1142the total stopping time
Highest value reached49,957,7206× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps7,401,143 → 22,203,430 → 11,101,715 → 33,305,146 → 16,652,573 → 49,957,720 → 24,978,860 → 12,489,430 → 6,244,715 → 18,734,146 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage740,114,300%
7,401,143% as a decimal74,011.43
7,401,143% of 1007,401,143
7,401,143% of 1,00074,011,430
As a fraction of 1007,401,143/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 7,401,143
Nerdulate something else
Nothing in mind? Surprise me · today’s page