Recognised as Number
7,324,769
- Positive
- Odd
- Prime
- 7 digits
7,324,769 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,324,769
Digit count7
Digit sum38
Digit product63,504
Multiplicative persistence2times 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,324,769
Distinct prime factors17,324,769
Number of divisors2
Sum of divisors σ(n)7,324,770
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)7,324,768integers below n that share no factor with it
Carmichael function λ(n)7,324,768the 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,324,7692 in total
Arithmetic
Previous number7,324,768
Next number7,324,770
Double14,649,538
Half3,662,384.5
Square53,652,240,903,361
Cube392,990,270,949,470,648,609
Square root2,706.431044752≈irrational, shown to 9 decimal places
Cube root194.206894803≈
Negation-7,324,769
Reciprocal1.36523077 × 10^-7≈
Representations
Decimal7,324,769
Binary1101111110001000110000123 bits
Octal33742141
Hexadecimal6FC461
Base 364CZTT
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsseven million, three hundred and twenty-four thousand, seven hundred and sixty-nine
Ordinalseven million, three hundred and twenty-four thousand, seven hundred and sixty-ninth
Scientific notation7.324769 × 10^6
Engineering notation7.324769 × 10^6
In other bases
Ternary111210010200202base 3; the most digit-efficient integer base after e: 15 digits
Quinary3333343034base 5; one hand: 10 digits
Septenary116155004base 7: 9 digits
Nonary14703622base 9; each digit is two ternary digits: 8 digits
Duodecimal2552a55base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal25fbi9base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal33:54:39:29base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1TTTT10011T01T1Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101100001100010110100001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000011011111100010001100001
Bit length23 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits11within that length
Bit parityeven12 set bits, so even; 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
Bytes36f c4 61
Gray code10110000010011001010001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000011011111100010001100001
64-bit0000000000000000000000000000000000000000011011111100010001100001
One's complement11111111100100000011101110011110at 32 bits, every bit flipped
Bits reversed10000110001000111111011000000000at 32 bits
Rotated left by 100000000110111111000100011000010at 32 bits, wrapping
Shifted left by 1110111111000100011000010= 14,649,538, no wrap
Shifted right by 11101111110001000110000= 3,662,384, discarding the low bit
These bits as a double3.61891673 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
7,324,769 to the power 253,652,240,903,361
7,324,769 to the power 3392,990,270,949,470,648,609
7,324,769 to the power 42,878,562,953,952,283,173,341,096,321
7,324,769 to the power 521,084,808,689,658,111,267,310,488,758,074,849
First ten multiples7,324,769, 14,649,538, 21,974,307, 29,299,076, 36,623,845, 43,948,614, 51,273,383, 58,598,152, 65,922,921, 73,247,690
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 1
Divisible by 5No, remainder 4
Divisible by 6No, remainder 5
Divisible by 7No, remainder 4
Divisible by 8No, remainder 1
Divisible by 9No, remainder 2
Divisible by 10No, remainder 9
Divisible by 11No, remainder 1
Divisible by 12No, remainder 5
Divisible by 100No, remainder 69
Collatz (3n + 1) trajectory
Steps to reach 1111the total stopping time
Highest value reached27,811,2403× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps7,324,769 → 21,974,308 → 10,987,154 → 5,493,577 → 16,480,732 → 8,240,366 → 4,120,183 → 12,360,550 → 6,180,275 → 18,540,826 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage732,476,900%
7,324,769% as a decimal73,247.69
7,324,769% of 1007,324,769
7,324,769% of 1,00073,247,690
As a fraction of 1007,324,769/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,324,769
Nerdulate something else
Nothing in mind? Surprise me · today’s page