Recognised as Number
7,363,487
- Positive
- Odd
- Prime
- 7 digits
7,363,487 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,363,487
Digit count7
Digit sum38
Digit product84,672
Multiplicative persistence7times 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,363,487
Distinct prime factors17,363,487
Number of divisors2
Sum of divisors σ(n)7,363,488
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)7,363,486integers below n that share no factor with it
Carmichael function λ(n)7,363,486the 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,363,4872 in total
Arithmetic
Previous number7,363,486
Next number7,363,488
Double14,726,974
Half3,681,743.5
Square54,220,940,799,169
Cube399,255,192,702,450,542,303
Square root2,713.574579775≈irrational, shown to 9 decimal places
Cube root194.548479753≈
Negation-7,363,487
Reciprocal1.35805224 × 10^-7≈
Representations
Decimal7,363,487
Binary1110000010110111001111123 bits
Octal34055637
Hexadecimal705B9F
Base 364DTPB
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsseven million, three hundred and sixty-three thousand, four hundred and eighty-seven
Ordinalseven million, three hundred and sixty-three thousand, four hundred and eighty-seventh
Scientific notation7.363487 × 10^6
Engineering notation7.363487 × 10^6
In other bases
Ternary111212002210202base 3; the most digit-efficient integer base after e: 15 digits
Quinary3341112422base 5; one hand: 10 digits
Septenary116405615base 7: 9 digits
Nonary14762722base 9; each digit is two ternary digits: 8 digits
Duodecimal257133bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal2608e7base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal34:5:24:47base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1TTT0TT010T11T1Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101100011010110011100011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000011100000101101110011111
Bit length23 bitsto write the magnitude
Set bits14the population count, or Hamming weight
Zero bits9within that length
Bit parityeven14 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
Bytes370 5b 9f
Gray code10010000111011001010000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000011100000101101110011111
64-bit0000000000000000000000000000000000000000011100000101101110011111
One's complement11111111100011111010010001100000at 32 bits, every bit flipped
Bits reversed11111001110110100000111000000000at 32 bits
Rotated left by 100000000111000001011011100111110at 32 bits, wrapping
Shifted left by 1111000001011011100111110= 14,726,974, no wrap
Shifted right by 11110000010110111001111= 3,681,743, discarding the low bit
These bits as a double3.63804596 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
7,363,487 to the power 254,220,940,799,169
7,363,487 to the power 3399,255,192,702,450,542,303
7,363,487 to the power 42,939,910,421,146,989,436,391,090,561
7,363,487 to the power 521,647,992,167,280,381,804,003,122,261,746,207
First ten multiples7,363,487, 14,726,974, 22,090,461, 29,453,948, 36,817,435, 44,180,922, 51,544,409, 58,907,896, 66,271,383, 73,634,870
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 2
Divisible by 6No, remainder 5
Divisible by 7No, remainder 5
Divisible by 8No, remainder 7
Divisible by 9No, remainder 2
Divisible by 10No, remainder 7
Divisible by 11No, remainder 10
Divisible by 12No, remainder 11
Divisible by 100No, remainder 87
Collatz (3n + 1) trajectory
Steps to reach 1279the total stopping time
Highest value reached125,812,09617× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps7,363,487 → 22,090,462 → 11,045,231 → 33,135,694 → 16,567,847 → 49,703,542 → 24,851,771 → 74,555,314 → 37,277,657 → 111,832,972 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage736,348,700%
7,363,487% as a decimal73,634.87
7,363,487% of 1007,363,487
7,363,487% of 1,00073,634,870
As a fraction of 1007,363,487/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,363,487
Nerdulate something else
Nothing in mind? Surprise me · today’s page