Recognised as Number
7,742,569
- Positive
- Odd
- Prime
- 7 digits
7,742,569 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value7,742,569
Digit count7
Digit sum40
Digit product105,840
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation7,742,569
Distinct prime factors17,742,569
Number of divisors2
Sum of divisors σ(n)7,742,570
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)7,742,568integers below n that share no factor with it
Carmichael function λ(n)7,742,568the 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,742,5692 in total
Arithmetic
Previous number7,742,568
Next number7,742,570
Double15,485,138
Half3,871,284.5
Square59,947,374,719,761
Cube464,146,685,136,605,206,009
Square root2,782.547214334≈irrational, shown to 9 decimal places
Cube root197.831310596≈
Negation-7,742,569
Reciprocal1.29156098 × 10^-7≈
Representations
Decimal7,742,569
Binary1110110001001000110100123 bits
Octal35422151
Hexadecimal762469
Base 364LY7D
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsseven million, seven hundred and forty-two thousand, five hundred and sixty-nine
Ordinalseven million, seven hundred and forty-two thousand, five hundred and sixty-ninth
Scientific notation7.742569 × 10^6
Engineering notation7.742569 × 10^6
In other bases
Ternary112120100210211base 3; the most digit-efficient integer base after e: 15 digits
Quinary3440230234base 5; one hand: 10 digits
Septenary122545042base 7: 9 digits
Nonary15510724base 9; each digit is two ternary digits: 8 digits
Duodecimal27147a1base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal287g89base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal35:50:42:49base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1TT0TT0101T11T11digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1100010100110010110111001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000011101100010010001101001
Bit length23 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits12within that length
Bit parityodd11 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
Bytes376 24 69
Gray code10011010011011001011101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000011101100010010001101001
64-bit0000000000000000000000000000000000000000011101100010010001101001
One's complement11111111100010011101101110010110at 32 bits, every bit flipped
Bits reversed10010110001001000110111000000000at 32 bits
Rotated left by 100000000111011000100100011010010at 32 bits, wrapping
Shifted left by 1111011000100100011010010= 15,485,138, no wrap
Shifted right by 11110110001001000110100= 3,871,284, discarding the low bit
These bits as a double3.82533735 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
7,742,569 to the power 259,947,374,719,761
7,742,569 to the power 3464,146,685,136,605,206,009
7,742,569 to the power 43,593,687,735,791,440,233,283,897,121
7,742,569 to the power 527,824,375,258,818,995,615,576,670,048,243,849
First ten multiples7,742,569, 15,485,138, 23,227,707, 30,970,276, 38,712,845, 46,455,414, 54,197,983, 61,940,552, 69,683,121, 77,425,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 1
Divisible by 4No, remainder 1
Divisible by 5No, remainder 4
Divisible by 6No, remainder 1
Divisible by 7No, remainder 2
Divisible by 8No, remainder 1
Divisible by 9No, remainder 4
Divisible by 10No, remainder 9
Divisible by 11No, remainder 10
Divisible by 12No, remainder 1
Divisible by 100No, remainder 69
Collatz (3n + 1) trajectory
Steps to reach 1186the total stopping time
Highest value reached58,795,1447× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps7,742,569 → 23,227,708 → 11,613,854 → 5,806,927 → 17,420,782 → 8,710,391 → 26,131,174 → 13,065,587 → 39,196,762 → 19,598,381 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage774,256,900%
7,742,569% as a decimal77,425.69
7,742,569% of 1007,742,569
7,742,569% of 1,00077,425,690
As a fraction of 1007,742,569/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,742,569
Nerdulate something else
Nothing in mind? Surprise me · today’s page