Recognised as Number
1,432,147
- Positive
- Odd
- Prime
- 7 digits
1,432,147 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value1,432,147
Digit count7
Digit sum22
Digit product672
Multiplicative persistence4times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation1,432,147
Distinct prime factors11,432,147
Number of divisors2
Sum of divisors σ(n)1,432,148
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,432,146integers below n that share no factor with it
Carmichael function λ(n)1,432,146the 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, 1,432,1472 in total
Arithmetic
Previous number1,432,146
Next number1,432,148
Double2,864,294
Half716,073.5
Square2,051,045,029,609
Cube2,937,397,986,019,440,523
Square root1,196.723443407≈irrational, shown to 9 decimal places
Cube root112.718672621≈
Negation-1,432,147
Reciprocal6.98252344 × 10^-7≈
Representations
Decimal1,432,147
Binary10101110110100101001121 bits
Octal5355123
Hexadecimal15DA53
Base 36UP1V
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, four hundred and thirty-two thousand, one hundred and forty-seven
Ordinalone million, four hundred and thirty-two thousand, one hundred and forty-seventh
Scientific notation1.432147 × 10^6
Engineering notation1.432147 × 10^6
In other bases
Ternary2200202112111base 3; the most digit-efficient integer base after e: 13 digits
Quinary331312042base 5; one hand: 9 digits
Septenary15113233base 7: 8 digits
Nonary2622474base 9; each digit is two ternary digits: 7 digits
Duodecimal590957base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal8j077base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal6:37:49:7base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10T01T10TTT111digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11010100010111001010111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000101011101101001010011
Bit length21 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits9within that length
Bit parityeven12 set bits, so even; not the same as the number itself being odd
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes315 da 53
Gray code111110011011101111010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000101011101101001010011
64-bit0000000000000000000000000000000000000000000101011101101001010011
One's complement11111111111010100010010110101100at 32 bits, every bit flipped
Bits reversed11001010010110111010100000000000at 32 bits
Rotated left by 100000000001010111011010010100110at 32 bits, wrapping
Shifted left by 11010111011010010100110= 2,864,294, no wrap
Shifted right by 110101110110100101001= 716,073, discarding the low bit
These bits as a double7.07574632 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,432,147 to the power 22,051,045,029,609
1,432,147 to the power 32,937,397,986,019,440,523
1,432,147 to the power 44,206,785,713,483,783,686,692,881
1,432,147 to the power 56,024,735,539,208,660,355,546,149,445,507
First ten multiples1,432,147, 2,864,294, 4,296,441, 5,728,588, 7,160,735, 8,592,882, 10,025,029, 11,457,176, 12,889,323, 14,321,470
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 3
Divisible by 5No, remainder 2
Divisible by 6No, remainder 1
Divisible by 7No, remainder 3
Divisible by 8No, remainder 3
Divisible by 9No, remainder 4
Divisible by 10No, remainder 7
Divisible by 11No, remainder 2
Divisible by 12No, remainder 7
Divisible by 100No, remainder 47
Collatz (3n + 1) trajectory
Steps to reach 1119the total stopping time
Highest value reached10,323,1247× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,432,147 → 4,296,442 → 2,148,221 → 6,444,664 → 3,222,332 → 1,611,166 → 805,583 → 2,416,750 → 1,208,375 → 3,625,126 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage143,214,700%
1,432,147% as a decimal14,321.47
1,432,147% of 1001,432,147
1,432,147% of 1,00014,321,470
As a fraction of 1001,432,147/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 1,432,147
Nerdulate something else
Nothing in mind? Surprise me · today’s page