Recognised as Number
1,304,137
- Positive
- Odd
- Prime
- 7 digits
1,304,137 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 value1,304,137
Digit count7
Digit sum19
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times 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 factorisation1,304,137
Distinct prime factors11,304,137
Number of divisors2
Sum of divisors σ(n)1,304,138
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,304,136integers below n that share no factor with it
Carmichael function λ(n)1,304,136the 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,304,1372 in total
Arithmetic
Previous number1,304,136
Next number1,304,138
Double2,608,274
Half652,068.5
Square1,700,773,314,769
Cube2,218,041,408,402,899,353
Square root1,141.988178573≈irrational, shown to 9 decimal places
Cube root109.254937315≈
Negation-1,304,137
Reciprocal7.66790606 × 10^-7≈
Representations
Decimal1,304,137
Binary10011111001100100100121 bits
Octal4763111
Hexadecimal13E649
Base 36RYA1
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, three hundred and four thousand, one hundred and thirty-seven
Ordinalone million, three hundred and four thousand, one hundred and thirty-seventh
Scientific notation1.304137 × 10^6
Engineering notation1.304137 × 10^6
In other bases
Ternary2110020221101base 3; the most digit-efficient integer base after e: 13 digits
Quinary313213022base 5; one hand: 9 digits
Septenary14041102base 7: 8 digits
Nonary2406841base 9; each digit is two ternary digits: 7 digits
Duodecimal52a861base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal8306hbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal6:2:15:37base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1101T10T1101digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101000011101001011001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100111110011001001001
Bit length21 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits10within that length
Bit parityodd11 set bits, so odd; 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
Bytes313 e6 49
Gray code110100001010101101101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100111110011001001001
64-bit0000000000000000000000000000000000000000000100111110011001001001
One's complement11111111111011000001100110110110at 32 bits, every bit flipped
Bits reversed10010010011001111100100000000000at 32 bits
Rotated left by 100000000001001111100110010010010at 32 bits, wrapping
Shifted left by 11001111100110010010010= 2,608,274, no wrap
Shifted right by 110011111001100100100= 652,068, discarding the low bit
These bits as a double6.44329289 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,304,137 to the power 21,700,773,314,769
1,304,137 to the power 32,218,041,408,402,899,353
1,304,137 to the power 42,892,629,868,230,331,953,523,361
1,304,137 to the power 53,772,385,638,464,300,422,872,095,444,457
First ten multiples1,304,137, 2,608,274, 3,912,411, 5,216,548, 6,520,685, 7,824,822, 9,128,959, 10,433,096, 11,737,233, 13,041,370
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 1
Divisible by 5No, remainder 2
Divisible by 6No, remainder 1
Divisible by 7No, remainder 2
Divisible by 8No, remainder 1
Divisible by 9No, remainder 1
Divisible by 10No, remainder 7
Divisible by 11No, remainder 10
Divisible by 12No, remainder 1
Divisible by 100No, remainder 37
Collatz (3n + 1) trajectory
Steps to reach 1186the total stopping time
Highest value reached6,602,2005× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,304,137 → 3,912,412 → 1,956,206 → 978,103 → 2,934,310 → 1,467,155 → 4,401,466 → 2,200,733 → 6,602,200 → 3,301,100 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage130,413,700%
1,304,137% as a decimal13,041.37
1,304,137% of 1001,304,137
1,304,137% of 1,00013,041,370
As a fraction of 1001,304,137/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,304,137
Nerdulate something else
Nothing in mind? Surprise me · today’s page