Recognised as Number
7,095,131
- Positive
- Odd
- Composite
- 7 digits
7,095,131 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 8.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value7,095,131
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 factorisation467 × 15,193
Distinct prime factors2467, 15,193
Number of divisors4
Sum of divisors σ(n)7,110,792
Aliquot sum15,661sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)7,079,472integers below n that share no factor with it
Carmichael function λ(n)3,539,736the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 7,079,472
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 467, 15,193, 7,095,1314 in total
Arithmetic
Previous number7,095,130
Next number7,095,132
Double14,190,262
Half3,547,565.5
Square50,340,883,907,161
Cube357,175,165,977,099,133,091
Square root2,663.668710632≈irrational, shown to 9 decimal places
Cube root192.155788995≈
Negation-7,095,131
Reciprocal1.40941725 × 10^-7≈
Representations
Decimal7,095,131
Binary1101100010000110101101123 bits
Octal33041533
Hexadecimal6C435B
Base 36482MZ
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsseven million, ninety-five thousand, one hundred and thirty-one
Ordinalseven million, ninety-five thousand, one hundred and thirty-first
Scientific notation7.095131 × 10^6
Engineering notation7.095131 × 10^6
In other bases
Ternary111100110200122base 3; the most digit-efficient integer base after e: 15 digits
Quinary3304021011base 5; one hand: 10 digits
Septenary114210341base 7: 9 digits
Nonary14313618base 9; each digit is two ternary digits: 8 digits
Duodecimal2461b8bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal246hgbbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal32:50:52:11base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary111100111T01T0Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101111000100010010101111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000011011000100001101011011
Bit length23 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits11within that length
Bit parityeven12 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
Bytes36c 43 5b
Gray code10110100110001011110110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000011011000100001101011011
64-bit0000000000000000000000000000000000000000011011000100001101011011
One's complement11111111100100111011110010100100at 32 bits, every bit flipped
Bits reversed11011010110000100011011000000000at 32 bits
Rotated left by 100000000110110001000011010110110at 32 bits, wrapping
Shifted left by 1110110001000011010110110= 14,190,262, no wrap
Shifted right by 11101100010000110101101= 3,547,565, discarding the low bit
These bits as a double3.50546048 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
7,095,131 to the power 250,340,883,907,161
7,095,131 to the power 3357,175,165,977,099,133,091
7,095,131 to the power 42,534,204,592,554,261,349,267,079,921
7,095,131 to the power 517,980,513,564,974,108,881,286,686,026,964,651
First ten multiples7,095,131, 14,190,262, 21,285,393, 28,380,524, 35,475,655, 42,570,786, 49,665,917, 56,761,048, 63,856,179, 70,951,310
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 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 1
Divisible by 8No, remainder 3
Divisible by 9No, remainder 8
Divisible by 10No, remainder 1
Divisible by 11No, remainder 10
Divisible by 12No, remainder 11
Divisible by 100No, remainder 31
Collatz (3n + 1) trajectory
Steps to reach 1121the total stopping time
Highest value reached109,227,50815× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps7,095,131 → 21,285,394 → 10,642,697 → 31,928,092 → 15,964,046 → 7,982,023 → 23,946,070 → 11,973,035 → 35,919,106 → 17,959,553 → …
Last steps… → 32 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage709,513,100%
7,095,131% as a decimal70,951.31
7,095,131% of 1007,095,131
7,095,131% of 1,00070,951,310
As a fraction of 1007,095,131/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,095,131
Nerdulate something else
Nothing in mind? Surprise me · today’s page