Recognised as Number
1,345,043
- Positive
- Odd
- Composite
- 7 digits
1,345,043 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 2.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,345,043
Digit count7
Digit sum20
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation7 × 192,149
Distinct prime factors27, 192,149
Number of divisors4
Sum of divisors σ(n)1,537,200
Aliquot sum192,157sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,152,888integers below n that share no factor with it
Carmichael function λ(n)576,444the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,152,888
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 7, 192,149, 1,345,0434 in total
Arithmetic
Previous number1,345,042
Next number1,345,044
Double2,690,086
Half672,521.5
Square1,809,140,671,849
Cube2,433,371,996,685,794,507
Square root1,159.759888943≈irrational, shown to 9 decimal places
Cube root110.385506875≈
Negation-1,345,043
Reciprocal7.43470655 × 10^-7≈
Representations
Decimal1,345,043
Binary10100100001100001001121 bits
Octal5103023
Hexadecimal148613
Base 36STUB
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, three hundred and forty-five thousand and forty-three
Ordinalone million, three hundred and forty-five thousand and forty-third
Scientific notation1.345043 × 10^6
Engineering notation1.345043 × 10^6
In other bases
Ternary2112100001102base 3; the most digit-efficient integer base after e: 13 digits
Quinary321020133base 5; one hand: 9 digits
Septenary14301260base 7: 8 digits
Nonary2470042base 9; each digit is two ternary digits: 7 digits
Duodecimal54a46bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal882c3base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal6:13:37:23base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10TTT10000111Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101011001101000010111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000101001000011000010011
Bit length21 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits13within that length
Bit parityeven8 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
Bytes314 86 13
Gray code111101100010100011010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000101001000011000010011
64-bit0000000000000000000000000000000000000000000101001000011000010011
One's complement11111111111010110111100111101100at 32 bits, every bit flipped
Bits reversed11001000011000010010100000000000at 32 bits
Rotated left by 100000000001010010000110000100110at 32 bits, wrapping
Shifted left by 11010010000110000100110= 2,690,086, no wrap
Shifted right by 110100100001100001001= 672,521, discarding the low bit
These bits as a double6.64539538 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,345,043 to the power 21,809,140,671,849
1,345,043 to the power 32,433,371,996,685,794,507
1,345,043 to the power 43,272,989,970,538,251,101,078,801
1,345,043 to the power 54,402,312,248,942,680,875,748,333,733,443
First ten multiples1,345,043, 2,690,086, 4,035,129, 5,380,172, 6,725,215, 8,070,258, 9,415,301, 10,760,344, 12,105,387, 13,450,430
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 2
Divisible by 4No, remainder 3
Divisible by 5No, remainder 3
Divisible by 6No, remainder 5
Divisible by 7Yes
Divisible by 8No, remainder 3
Divisible by 9No, remainder 2
Divisible by 10No, remainder 3
Divisible by 11No, remainder 7
Divisible by 12No, remainder 11
Divisible by 100No, remainder 43
Collatz (3n + 1) trajectory
Steps to reach 1137the total stopping time
Highest value reached6,052,6964× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,345,043 → 4,035,130 → 2,017,565 → 6,052,696 → 3,026,348 → 1,513,174 → 756,587 → 2,269,762 → 1,134,881 → 3,404,644 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage134,504,300%
1,345,043% as a decimal13,450.43
1,345,043% of 1001,345,043
1,345,043% of 1,00013,450,430
As a fraction of 1001,345,043/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,345,043
Nerdulate something else
Nothing in mind? Surprise me · today’s page