Recognised as Number
1,344,907
- Positive
- Odd
- Prime
- 7 digits
1,344,907 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,344,907
Digit count7
Digit sum28
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,344,907
Distinct prime factors11,344,907
Number of divisors2
Sum of divisors σ(n)1,344,908
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,344,906integers below n that share no factor with it
Carmichael function λ(n)1,344,906the 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,344,9072 in total
Arithmetic
Previous number1,344,906
Next number1,344,908
Double2,689,814
Half672,453.5
Square1,808,774,838,649
Cube2,432,633,941,922,910,643
Square root1,159.701254634≈irrational, shown to 9 decimal places
Cube root110.381786317≈
Negation-1,344,907
Reciprocal7.43545836 × 10^-7≈
Representations
Decimal1,344,907
Binary10100100001011000101121 bits
Octal5102613
Hexadecimal14858B
Base 36STQJ
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, three hundred and forty-four thousand, nine hundred and seven
Ordinalone million, three hundred and forty-four thousand, nine hundred and seventh
Scientific notation1.344907 × 10^6
Engineering notation1.344907 × 10^6
In other bases
Ternary2112022212101base 3; the most digit-efficient integer base after e: 13 digits
Quinary321014112base 5; one hand: 9 digits
Septenary14301004base 7: 8 digits
Nonary2468771base 9; each digit is two ternary digits: 7 digits
Duodecimal54a377base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal88257base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal6:13:35:7base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10TTT1000TT101digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101011001101010011111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000101001000010110001011
Bit length21 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits12within that length
Bit parityodd9 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
Bytes314 85 8b
Gray code111101100011101001110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000101001000010110001011
64-bit0000000000000000000000000000000000000000000101001000010110001011
One's complement11111111111010110111101001110100at 32 bits, every bit flipped
Bits reversed11010001101000010010100000000000at 32 bits
Rotated left by 100000000001010010000101100010110at 32 bits, wrapping
Shifted left by 11010010000101100010110= 2,689,814, no wrap
Shifted right by 110100100001011000101= 672,453, discarding the low bit
These bits as a double6.64472346 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,344,907 to the power 21,808,774,838,649
1,344,907 to the power 32,432,633,941,922,910,643
1,344,907 to the power 43,271,666,416,929,715,984,145,201
1,344,907 to the power 54,400,087,065,793,693,535,088,769,841,307
First ten multiples1,344,907, 2,689,814, 4,034,721, 5,379,628, 6,724,535, 8,069,442, 9,414,349, 10,759,256, 12,104,163, 13,449,070
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 4
Divisible by 8No, remainder 3
Divisible by 9No, remainder 1
Divisible by 10No, remainder 7
Divisible by 11No, remainder 3
Divisible by 12No, remainder 7
Divisible by 100No, remainder 7
Collatz (3n + 1) trajectory
Steps to reach 1137the total stopping time
Highest value reached6,052,0844× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,344,907 → 4,034,722 → 2,017,361 → 6,052,084 → 3,026,042 → 1,513,021 → 4,539,064 → 2,269,532 → 1,134,766 → 567,383 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage134,490,700%
1,344,907% as a decimal13,449.07
1,344,907% of 1001,344,907
1,344,907% of 1,00013,449,070
As a fraction of 1001,344,907/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,344,907
Nerdulate something else
Nothing in mind? Surprise me · today’s page