Recognised as Number
7,565,113
- Positive
- Odd
- Prime
- 7 digits
7,565,113 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value7,565,113
Digit count7
Digit sum28
Digit product3,150
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation7,565,113
Distinct prime factors17,565,113
Number of divisors2
Sum of divisors σ(n)7,565,114
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)7,565,112integers below n that share no factor with it
Carmichael function λ(n)7,565,112the 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,565,1132 in total
Arithmetic
Previous number7,565,112
Next number7,565,114
Double15,130,226
Half3,782,556.5
Square57,230,934,702,769
Cube432,958,488,122,068,897,897
Square root2,750.475049878≈irrational, shown to 9 decimal places
Cube root196.308214572≈
Negation-7,565,113
Reciprocal1.32185732 × 10^-7≈
Representations
Decimal7,565,113
Binary1110011011011110011100123 bits
Octal34667471
Hexadecimal736F39
Base 364I5A1
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsseven million, five hundred and sixty-five thousand, one hundred and thirteen
Ordinalseven million, five hundred and sixty-five thousand, one hundred and thirteenth
Scientific notation7.565113 × 10^6
Engineering notation7.565113 × 10^6
In other bases
Ternary112020100101101base 3; the most digit-efficient integer base after e: 15 digits
Quinary3414040423base 5; one hand: 10 digits
Septenary121205503base 7: 9 digits
Nonary15210341base 9; each digit is two ternary digits: 8 digits
Duodecimal2649b61base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal275cfdbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal35:1:25:13base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1TTT1T0100101101digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101101001011001101001001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000011100110110111100111001
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
Bytes373 6f 39
Gray code10010101101100010100101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000011100110110111100111001
64-bit0000000000000000000000000000000000000000011100110110111100111001
One's complement11111111100011001001000011000110at 32 bits, every bit flipped
Bits reversed10011100111101101100111000000000at 32 bits
Rotated left by 100000000111001101101111001110010at 32 bits, wrapping
Shifted left by 1111001101101111001110010= 15,130,226, no wrap
Shifted right by 11110011011011110011100= 3,782,556, discarding the low bit
These bits as a double3.73766244 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
7,565,113 to the power 257,230,934,702,769
7,565,113 to the power 3432,958,488,122,068,897,897
7,565,113 to the power 43,275,379,886,952,609,006,376,267,361
7,565,113 to the power 524,778,618,962,723,712,778,054,183,104,176,793
First ten multiples7,565,113, 15,130,226, 22,695,339, 30,260,452, 37,825,565, 45,390,678, 52,955,791, 60,520,904, 68,086,017, 75,651,130
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 3
Divisible by 6No, remainder 1
Divisible by 7No, remainder 3
Divisible by 8No, remainder 1
Divisible by 9No, remainder 1
Divisible by 10No, remainder 3
Divisible by 11No, remainder 6
Divisible by 12No, remainder 1
Divisible by 100No, remainder 13
Collatz (3n + 1) trajectory
Steps to reach 1248the total stopping time
Highest value reached25,532,2603× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps7,565,113 → 22,695,340 → 11,347,670 → 5,673,835 → 17,021,506 → 8,510,753 → 25,532,260 → 12,766,130 → 6,383,065 → 19,149,196 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage756,511,300%
7,565,113% as a decimal75,651.13
7,565,113% of 1007,565,113
7,565,113% of 1,00075,651,130
As a fraction of 1007,565,113/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,565,113
Nerdulate something else
Nothing in mind? Surprise me · today’s page