Recognised as Number
6,752,131
- Positive
- Odd
- Prime
- 7 digits
6,752,131 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value6,752,131
Digit count7
Digit sum25
Digit product1,260
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation6,752,131
Distinct prime factors16,752,131
Number of divisors2
Sum of divisors σ(n)6,752,132
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)6,752,130integers below n that share no factor with it
Carmichael function λ(n)6,752,130the 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, 6,752,1312 in total
Arithmetic
Previous number6,752,130
Next number6,752,132
Double13,504,262
Half3,376,065.5
Square45,591,273,041,161
Cube307,838,248,030,687,464,091
Square root2,598.486290131≈irrational, shown to 9 decimal places
Cube root189.008043479≈
Negation-6,752,131
Reciprocal1.48101392 × 10^-7≈
Representations
Decimal6,752,131
Binary1100111000001111000001123 bits
Octal31603603
Hexadecimal670783
Base 3640PZ7
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordssix million, seven hundred and fifty-two thousand, one hundred and thirty-one
Ordinalsix million, seven hundred and fifty-two thousand, one hundred and thirty-first
Scientific notation6.752131 × 10^6
Engineering notation6.752131 × 10^6
In other bases
Ternary110201001011221base 3; the most digit-efficient integer base after e: 15 digits
Quinary3212032011base 5; one hand: 10 digits
Septenary111251341base 7: 9 digits
Nonary13631157base 9; each digit is two ternary digits: 8 digits
Duodecimal2317597base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal22406bbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal31:15:35:31base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary111T010011TT0T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101110110001100010000111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000011001110000011110000011
Bit length23 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits12within that length
Bit parityodd11 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
Bytes367 07 83
Gray code10101001000010001000010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000011001110000011110000011
64-bit0000000000000000000000000000000000000000011001110000011110000011
One's complement11111111100110001111100001111100at 32 bits, every bit flipped
Bits reversed11000001111000001110011000000000at 32 bits
Rotated left by 100000000110011100000111100000110at 32 bits, wrapping
Shifted left by 1110011100000111100000110= 13,504,262, no wrap
Shifted right by 11100111000001111000001= 3,376,065, discarding the low bit
These bits as a double3.33599596 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
6,752,131 to the power 245,591,273,041,161
6,752,131 to the power 3307,838,248,030,687,464,091
6,752,131 to the power 42,078,564,177,513,693,777,600,227,921
6,752,131 to the power 514,034,737,618,479,714,680,241,604,552,449,651
First ten multiples6,752,131, 13,504,262, 20,256,393, 27,008,524, 33,760,655, 40,512,786, 47,264,917, 54,017,048, 60,769,179, 67,521,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 1
Divisible by 4No, remainder 3
Divisible by 5No, remainder 1
Divisible by 6No, remainder 1
Divisible by 7No, remainder 1
Divisible by 8No, remainder 3
Divisible by 9No, remainder 7
Divisible by 10No, remainder 1
Divisible by 11No, remainder 1
Divisible by 12No, remainder 7
Divisible by 100No, remainder 31
Collatz (3n + 1) trajectory
Steps to reach 185the total stopping time
Highest value reached30,384,5924× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps6,752,131 → 20,256,394 → 10,128,197 → 30,384,592 → 15,192,296 → 7,596,148 → 3,798,074 → 1,899,037 → 5,697,112 → 2,848,556 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage675,213,100%
6,752,131% as a decimal67,521.31
6,752,131% of 1006,752,131
6,752,131% of 1,00067,521,310
As a fraction of 1006,752,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 6,752,131
Nerdulate something else
Nothing in mind? Surprise me · today’s page