Recognised as Number
7,502,813
- Positive
- Odd
- Prime
- 7 digits
7,502,813 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,502,813
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,502,813
Distinct prime factors17,502,813
Number of divisors2
Sum of divisors σ(n)7,502,814
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)7,502,812integers below n that share no factor with it
Carmichael function λ(n)7,502,812the 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,502,8132 in total
Arithmetic
Previous number7,502,812
Next number7,502,814
Double15,005,626
Half3,751,406.5
Square56,292,202,912,969
Cube422,349,871,814,061,681,797
Square root2,739.126320563≈irrational, shown to 9 decimal places
Cube root195.767851272≈
Negation-7,502,813
Reciprocal1.33283343 × 10^-7≈
Representations
Decimal7,502,813
Binary1110010011110111101110123 bits
Octal34475735
Hexadecimal727BDD
Base 364GT7H
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsseven million, five hundred and two thousand, eight hundred and thirteen
Ordinalseven million, five hundred and two thousand, eight hundred and thirteenth
Scientific notation7.502813 × 10^6
Engineering notation7.502813 × 10^6
In other bases
Ternary112010011220222base 3; the most digit-efficient integer base after e: 15 digits
Quinary3410042223base 5; one hand: 10 digits
Septenary120526043base 7: 9 digits
Nonary15104828base 9; each digit is two ternary digits: 8 digits
Duodecimal2619aa5base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal26hh0dbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal34:44:6:53base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1TTT0101TT0T100Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101101111000110000101101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000011100100111101111011101
Bit length23 bitsto write the magnitude
Set bits16the population count, or Hamming weight
Zero bits7within that length
Bit parityeven16 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
Bytes372 7b dd
Gray code10010110100011000110011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000011100100111101111011101
64-bit0000000000000000000000000000000000000000011100100111101111011101
One's complement11111111100011011000010000100010at 32 bits, every bit flipped
Bits reversed10111011110111100100111000000000at 32 bits
Rotated left by 100000000111001001111011110111010at 32 bits, wrapping
Shifted left by 1111001001111011110111010= 15,005,626, no wrap
Shifted right by 11110010011110111101110= 3,751,406, discarding the low bit
These bits as a double3.70688215 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
7,502,813 to the power 256,292,202,912,969
7,502,813 to the power 3422,349,871,814,061,681,797
7,502,813 to the power 43,168,812,108,794,875,568,988,394,961
7,502,813 to the power 523,775,004,684,423,606,752,388,526,562,525,293
First ten multiples7,502,813, 15,005,626, 22,508,439, 30,011,252, 37,514,065, 45,016,878, 52,519,691, 60,022,504, 67,525,317, 75,028,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 2
Divisible by 4No, remainder 1
Divisible by 5No, remainder 3
Divisible by 6No, remainder 5
Divisible by 7No, remainder 3
Divisible by 8No, remainder 5
Divisible by 9No, remainder 8
Divisible by 10No, remainder 3
Divisible by 11No, remainder 10
Divisible by 12No, remainder 5
Divisible by 100No, remainder 13
Collatz (3n + 1) trajectory
Steps to reach 1186the total stopping time
Highest value reached22,508,4403× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps7,502,813 → 22,508,440 → 11,254,220 → 5,627,110 → 2,813,555 → 8,440,666 → 4,220,333 → 12,661,000 → 6,330,500 → 3,165,250 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage750,281,300%
7,502,813% as a decimal75,028.13
7,502,813% of 1007,502,813
7,502,813% of 1,00075,028,130
As a fraction of 1007,502,813/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,502,813
Nerdulate something else
Nothing in mind? Surprise me · today’s page