Recognised as Number
7,401,470
- Positive
- Even
- Composite
- 7 digits
7,401,470 is an even 7-digit integer and a composite number. It has 16 divisors and a digital root of 5.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value7,401,470
Digit count7
Digit sum23
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2 × 5 × 73 × 10,139
Distinct prime factors42, 5, 73, 10,139
Number of divisors16
Sum of divisors σ(n)13,506,480
Aliquot sum6,105,010sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,919,744integers below n that share no factor with it
Carmichael function λ(n)364,968the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,919,744
Möbius function μ(n)+14 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 5, 10, 73, 146, 365, 730, 10,139, 20,278, 50,695, 101,390, 740,147, 1,480,294, 3,700,735, 7,401,47016 in total
Arithmetic
Previous number7,401,469
Next number7,401,471
Double14,802,940
Half3,700,735
Square54,781,758,160,900
Cube405,465,539,575,156,523,000
Square root2,720.564279704≈irrational, shown to 9 decimal places
Cube root194.882418705≈
Negation-7,401,470
Reciprocal1.35108296 × 10^-7≈
Representations
Decimal7,401,470
Binary1110000111011111111111023 bits
Octal34167776
Hexadecimal70EFFE
Base 364EN0E
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsseven million, four hundred and one thousand, four hundred and seventy
Ordinalseven million, four hundred and one thousand, four hundred and seventieth
Scientific notation7.40147 × 10^6
Engineering notation7.40147 × 10^6
In other bases
Ternary111221000220112base 3; the most digit-efficient integer base after e: 15 digits
Quinary3343321340base 5; one hand: 10 digits
Septenary116624426base 7: 9 digits
Nonary14830815base 9; each digit is two ternary digits: 8 digits
Duodecimal258b312base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal2653dabase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal34:15:57:50base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1TTT0T10010T1TTTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101100010011000000000010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000011100001110111111111110
Bit length23 bitsto write the magnitude
Set bits17the population count, or Hamming weight
Zero bits6within that length
Bit parityodd17 set bits, so odd; not the same as the number itself being even
Highest set bitbit 22worth 4,194,304
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes370 ef fe
Gray code10010001001100000000001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000011100001110111111111110
64-bit0000000000000000000000000000000000000000011100001110111111111110
One's complement11111111100011110001000000000001at 32 bits, every bit flipped
Bits reversed01111111111101110000111000000000at 32 bits
Rotated left by 100000000111000011101111111111100at 32 bits, wrapping
Shifted left by 1111000011101111111111100= 14,802,940, no wrap
Shifted right by 11110000111011111111111= 3,700,735, discarding the low bit
These bits as a double3.65681206 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
7,401,470 to the power 254,781,758,160,900
7,401,470 to the power 3405,465,539,575,156,523,000
7,401,470 to the power 43,001,041,027,199,333,750,288,810,000
7,401,470 to the power 522,212,115,131,585,052,772,750,118,550,700,000
First ten multiples7,401,470, 14,802,940, 22,204,410, 29,605,880, 37,007,350, 44,408,820, 51,810,290, 59,211,760, 66,613,230, 74,014,700
Powers of twoBetween 2^22 (4,194,304) and 2^23 (8,388,608)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 2
Divisible by 4No, remainder 2
Divisible by 5Yes
Divisible by 6No, remainder 2
Divisible by 7No, remainder 6
Divisible by 8No, remainder 6
Divisible by 9No, remainder 5
Divisible by 10Yes
Divisible by 11No, remainder 10
Divisible by 12No, remainder 2
Divisible by 100No, remainder 70
Collatz (3n + 1) trajectory
Steps to reach 1385the total stopping time
Highest value reached640,209,25686× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps7,401,470 → 3,700,735 → 11,102,206 → 5,551,103 → 16,653,310 → 8,326,655 → 24,979,966 → 12,489,983 → 37,469,950 → 18,734,975 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage740,147,000%
7,401,470% as a decimal74,014.7
7,401,470% of 1007,401,470
7,401,470% of 1,00074,014,700
As a fraction of 1007,401,470/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,470
Nerdulate something else
Nothing in mind? Surprise me · today’s page