Recognised as Number
7,007,303
- Positive
- Odd
- Prime
- 7 digits
7,007,303 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,007,303
Digit count7
Digit sum20
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times 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,007,303
Distinct prime factors17,007,303
Number of divisors2
Sum of divisors σ(n)7,007,304
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)7,007,302integers below n that share no factor with it
Carmichael function λ(n)7,007,302the 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,007,3032 in total
Arithmetic
Previous number7,007,302
Next number7,007,304
Double14,014,606
Half3,503,651.5
Square49,102,295,333,809
Cube344,074,661,399,485,807,127
Square root2,647.131088556≈irrational, shown to 9 decimal places
Cube root191.359619615≈
Negation-7,007,303
Reciprocal1.42708257 × 10^-7≈
Representations
Decimal7,007,303
Binary1101010111011000100011123 bits
Octal32566107
Hexadecimal6AEC47
Base 36466VB
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsseven million, seven thousand, three hundred and three
Ordinalseven million, seven thousand, three hundred and third
Scientific notation7.007303 × 10^6
Engineering notation7.007303 × 10^6
In other bases
Ternary111012000012202base 3; the most digit-efficient integer base after e: 15 digits
Quinary3243213203base 5; one hand: 10 digits
Septenary113363312base 7: 9 digits
Nonary14160182base 9; each digit is two ternary digits: 8 digits
Duodecimal241b19bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal23fi53base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal32:26:28:23base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1111TT0001T0T1Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101111110011110001011011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000011010101110110001000111
Bit length23 bitsto write the magnitude
Set bits13the population count, or Hamming weight
Zero bits10within that length
Bit parityodd13 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
Bytes36a ec 47
Gray code10111111001101001100100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000011010101110110001000111
64-bit0000000000000000000000000000000000000000011010101110110001000111
One's complement11111111100101010001001110111000at 32 bits, every bit flipped
Bits reversed11100010001101110101011000000000at 32 bits
Rotated left by 100000000110101011101100010001110at 32 bits, wrapping
Shifted left by 1110101011101100010001110= 14,014,606, no wrap
Shifted right by 11101010111011000100011= 3,503,651, discarding the low bit
These bits as a double3.46206768 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
7,007,303 to the power 249,102,295,333,809
7,007,303 to the power 3344,074,661,399,485,807,127
7,007,303 to the power 42,411,035,407,048,601,094,738,448,481
7,007,303 to the power 516,894,855,640,917,883,596,964,014,256,256,743
First ten multiples7,007,303, 14,014,606, 21,021,909, 28,029,212, 35,036,515, 42,043,818, 49,051,121, 56,058,424, 63,065,727, 70,073,030
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 3
Divisible by 5No, remainder 3
Divisible by 6No, remainder 5
Divisible by 7No, remainder 2
Divisible by 8No, remainder 7
Divisible by 9No, remainder 2
Divisible by 10No, remainder 3
Divisible by 11No, remainder 6
Divisible by 12No, remainder 11
Divisible by 100No, remainder 3
Collatz (3n + 1) trajectory
Steps to reach 1152the total stopping time
Highest value reached53,937,7367× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps7,007,303 → 21,021,910 → 10,510,955 → 31,532,866 → 15,766,433 → 47,299,300 → 23,649,650 → 11,824,825 → 35,474,476 → 17,737,238 → …
Last steps… → 32 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage700,730,300%
7,007,303% as a decimal70,073.03
7,007,303% of 1007,007,303
7,007,303% of 1,00070,073,030
As a fraction of 1007,007,303/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,007,303
Nerdulate something else
Nothing in mind? Surprise me · today’s page