Recognised as Number
7,401,167
- Positive
- Odd
- Prime
- 7 digits
7,401,167 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 8.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value7,401,167
Digit count7
Digit sum26
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation7,401,167
Distinct prime factors17,401,167
Number of divisors2
Sum of divisors σ(n)7,401,168
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)7,401,166integers below n that share no factor with it
Carmichael function λ(n)7,401,166the 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,1672 in total
Arithmetic
Previous number7,401,166
Next number7,401,168
Double14,802,334
Half3,700,583.5
Square54,777,272,961,889
Cube405,415,744,995,525,124,463
Square root2,720.508592157≈irrational, shown to 9 decimal places
Cube root194.879759315≈
Negation-7,401,167
Reciprocal1.35113827 × 10^-7≈
Representations
Decimal7,401,167
Binary1110000111011101100111123 bits
Octal34167317
Hexadecimal70EECF
Base 364EMRZ
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsseven million, four hundred and one thousand, one hundred and sixty-seven
Ordinalseven million, four hundred and one thousand, one hundred and sixty-seventh
Scientific notation7.401167 × 10^6
Engineering notation7.401167 × 10^6
In other bases
Ternary111221000111022base 3; the most digit-efficient integer base after e: 15 digits
Quinary3343314132base 5; one hand: 10 digits
Septenary116623514base 7: 9 digits
Nonary14830438base 9; each digit is two ternary digits: 8 digits
Duodecimal258b0bbbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal2652i7base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal34:15:52:47base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1TTT0T100011110Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101100010011001111010011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000011100001110111011001111
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 cf
Gray code10010001001100110101000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000011100001110111011001111
64-bit0000000000000000000000000000000000000000011100001110111011001111
One's complement11111111100011110001000100110000at 32 bits, every bit flipped
Bits reversed11110011011101110000111000000000at 32 bits
Rotated left by 100000000111000011101110110011110at 32 bits, wrapping
Shifted left by 1111000011101110110011110= 14,802,334, no wrap
Shifted right by 11110000111011101100111= 3,700,583, discarding the low bit
These bits as a double3.65666235 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
7,401,167 to the power 254,777,272,961,889
7,401,167 to the power 3405,415,744,995,525,124,463
7,401,167 to the power 43,000,549,633,141,295,698,846,448,321
7,401,167 to the power 522,207,568,926,667,464,063,544,271,380,590,607
First ten multiples7,401,167, 14,802,334, 22,203,501, 29,604,668, 37,005,835, 44,407,002, 51,808,169, 59,209,336, 66,610,503, 74,011,670
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 2
Divisible by 6No, remainder 5
Divisible by 7No, remainder 4
Divisible by 8No, remainder 7
Divisible by 9No, remainder 8
Divisible by 10No, remainder 7
Divisible by 11No, remainder 4
Divisible by 12No, remainder 11
Divisible by 100No, remainder 67
Collatz (3n + 1) trajectory
Steps to reach 1310the total stopping time
Highest value reached213,394,33628× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps7,401,167 → 22,203,502 → 11,101,751 → 33,305,254 → 16,652,627 → 49,957,882 → 24,978,941 → 74,936,824 → 37,468,412 → 18,734,206 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage740,116,700%
7,401,167% as a decimal74,011.67
7,401,167% of 1007,401,167
7,401,167% of 1,00074,011,670
As a fraction of 1007,401,167/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,167
Nerdulate something else
Nothing in mind? Surprise me · today’s page