Recognised as Number
7,315,487
- Positive
- Odd
- Prime
- 7 digits
7,315,487 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,315,487
Digit count7
Digit sum35
Digit product23,520
Multiplicative persistence2times 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,315,487
Distinct prime factors17,315,487
Number of divisors2
Sum of divisors σ(n)7,315,488
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)7,315,486integers below n that share no factor with it
Carmichael function λ(n)7,315,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,315,4872 in total
Arithmetic
Previous number7,315,486
Next number7,315,488
Double14,630,974
Half3,657,743.5
Square53,516,350,047,169
Cube391,498,163,057,514,206,303
Square root2,704.715696705≈irrational, shown to 9 decimal places
Cube root194.124826669≈
Negation-7,315,487
Reciprocal1.36696299 × 10^-7≈
Representations
Decimal7,315,487
Binary1101111101000000001111123 bits
Octal33720037
Hexadecimal6FA01F
Base 364CSNZ
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsseven million, three hundred and fifteen thousand, four hundred and eighty-seven
Ordinalseven million, three hundred and fifteen thousand, four hundred and eighty-seventh
Scientific notation7.315487 × 10^6
Engineering notation7.315487 × 10^6
In other bases
Ternary111202122221222base 3; the most digit-efficient integer base after e: 15 digits
Quinary3333043422base 5; one hand: 10 digits
Septenary116115644base 7: 9 digits
Nonary14678858base 9; each digit is two ternary digits: 8 digits
Duodecimal25495bbbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal25e8e7base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal33:52:4:47base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1TTTT10T0000T00Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101100001110000001100011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000011011111010000000011111
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
Bytes36f a0 1f
Gray code10110000111000000010000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000011011111010000000011111
64-bit0000000000000000000000000000000000000000011011111010000000011111
One's complement11111111100100000101111111100000at 32 bits, every bit flipped
Bits reversed11111000000001011111011000000000at 32 bits
Rotated left by 100000000110111110100000000111110at 32 bits, wrapping
Shifted left by 1110111110100000000111110= 14,630,974, no wrap
Shifted right by 11101111101000000001111= 3,657,743, discarding the low bit
These bits as a double3.61433081 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
7,315,487 to the power 253,516,350,047,169
7,315,487 to the power 3391,498,163,057,514,206,303
7,315,487 to the power 42,863,999,722,371,125,428,524,914,561
7,315,487 to the power 520,951,552,737,009,577,247,743,441,647,106,207
First ten multiples7,315,487, 14,630,974, 21,946,461, 29,261,948, 36,577,435, 43,892,922, 51,208,409, 58,523,896, 65,839,383, 73,154,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 4
Divisible by 8No, remainder 7
Divisible by 9No, remainder 8
Divisible by 10No, remainder 7
Divisible by 11No, remainder 3
Divisible by 12No, remainder 11
Divisible by 100No, remainder 87
Collatz (3n + 1) trajectory
Steps to reach 1217the total stopping time
Highest value reached1,710,413,332233× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps7,315,487 → 21,946,462 → 10,973,231 → 32,919,694 → 16,459,847 → 49,379,542 → 24,689,771 → 74,069,314 → 37,034,657 → 111,103,972 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage731,548,700%
7,315,487% as a decimal73,154.87
7,315,487% of 1007,315,487
7,315,487% of 1,00073,154,870
As a fraction of 1007,315,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,315,487
Nerdulate something else
Nothing in mind? Surprise me · today’s page