Recognised as Number
7,155,649
- Positive
- Odd
- Prime
- 7 digits
7,155,649 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,155,649
Digit count7
Digit sum37
Digit product37,800
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,155,649
Distinct prime factors17,155,649
Number of divisors2
Sum of divisors σ(n)7,155,650
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)7,155,648integers below n that share no factor with it
Carmichael function λ(n)7,155,648the 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,155,6492 in total
Arithmetic
Previous number7,155,648
Next number7,155,650
Double14,311,298
Half3,577,824.5
Square51,203,312,611,201
Cube366,392,932,683,027,824,449
Square root2,675.004485978≈irrational, shown to 9 decimal places
Cube root192.700574658≈
Negation-7,155,649
Reciprocal1.39749728 × 10^-7≈
Representations
Decimal7,155,649
Binary1101101001011111100000123 bits
Octal33227701
Hexadecimal6D2FC1
Base 3649DC1
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsseven million, one hundred and fifty-five thousand, six hundred and forty-nine
Ordinalseven million, one hundred and fifty-five thousand, six hundred and forty-ninth
Scientific notation7.155649 × 10^6
Engineering notation7.155649 × 10^6
In other bases
Ternary111110112201001base 3; the most digit-efficient integer base after e: 15 digits
Quinary3312440044base 5; one hand: 10 digits
Septenary114551644base 7: 9 digits
Nonary14415631base 9; each digit is two ternary digits: 8 digits
Duodecimal2491001base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal24e929base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal33:7:40:49base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary111111TT0T01001digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101111010111000011000001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000011011010010111111000001
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
Bytes36d 2f c1
Gray code10110111011100000100001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000011011010010111111000001
64-bit0000000000000000000000000000000000000000011011010010111111000001
One's complement11111111100100101101000000111110at 32 bits, every bit flipped
Bits reversed10000011111101001011011000000000at 32 bits
Rotated left by 100000000110110100101111110000010at 32 bits, wrapping
Shifted left by 1110110100101111110000010= 14,311,298, no wrap
Shifted right by 11101101001011111100000= 3,577,824, discarding the low bit
These bits as a double3.53536034 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
7,155,649 to the power 251,203,312,611,201
7,155,649 to the power 3366,392,932,683,027,824,449
7,155,649 to the power 42,621,779,222,360,375,368,990,662,401
7,155,649 to the power 518,760,531,870,703,797,648,742,664,419,053,249
First ten multiples7,155,649, 14,311,298, 21,466,947, 28,622,596, 35,778,245, 42,933,894, 50,089,543, 57,245,192, 64,400,841, 71,556,490
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 4
Divisible by 6No, remainder 1
Divisible by 7No, remainder 4
Divisible by 8No, remainder 1
Divisible by 9No, remainder 1
Divisible by 10No, remainder 9
Divisible by 11No, remainder 6
Divisible by 12No, remainder 1
Divisible by 100No, remainder 49
Collatz (3n + 1) trajectory
Steps to reach 198the total stopping time
Highest value reached21,466,9483× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps7,155,649 → 21,466,948 → 10,733,474 → 5,366,737 → 16,100,212 → 8,050,106 → 4,025,053 → 12,075,160 → 6,037,580 → 3,018,790 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage715,564,900%
7,155,649% as a decimal71,556.49
7,155,649% of 1007,155,649
7,155,649% of 1,00071,556,490
As a fraction of 1007,155,649/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,155,649
Nerdulate something else
Nothing in mind? Surprise me · today’s page