Recognised as Number
1,373,207
- Positive
- Odd
- Composite
- 7 digits
1,373,207 is an odd 7-digit integer and a composite number. It has 8 divisors and a digital root of 5.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,373,207
Digit count7
Digit sum23
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation11 × 31 × 4,027
Distinct prime factors311, 31, 4,027
Number of divisors8
Sum of divisors σ(n)1,546,752
Aliquot sum173,545sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,207,800integers below n that share no factor with it
Carmichael function λ(n)20,130the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,207,800
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 11, 31, 341, 4,027, 44,297, 124,837, 1,373,2078 in total
Arithmetic
Previous number1,373,206
Next number1,373,208
Double2,746,414
Half686,603.5
Square1,885,697,464,849
Cube2,589,452,958,612,900,743
Square root1,171.839152785≈irrational, shown to 9 decimal places
Cube root111.150649003≈
Negation-1,373,207
Reciprocal7.28222329 × 10^-7≈
Representations
Decimal1,373,207
Binary10100111101000001011121 bits
Octal5172027
Hexadecimal14F417
Base 36TFKN
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, three hundred and seventy-three thousand, two hundred and seven
Ordinalone million, three hundred and seventy-three thousand, two hundred and seventh
Scientific notation1.373207 × 10^6
Engineering notation1.373207 × 10^6
In other bases
Ternary2120202200112base 3; the most digit-efficient integer base after e: 13 digits
Quinary322420312base 5; one hand: 9 digits
Septenary14446343base 7: 8 digits
Nonary2522615base 9; each digit is two ternary digits: 7 digits
Duodecimal56281bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal8bd07base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal6:21:26:47base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10TT1T10T01TTTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101010011010001101011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000101001111010000010111
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
Bytes314 f4 17
Gray code111101000111000011100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000101001111010000010111
64-bit0000000000000000000000000000000000000000000101001111010000010111
One's complement11111111111010110000101111101000at 32 bits, every bit flipped
Bits reversed11101000001011110010100000000000at 32 bits
Rotated left by 100000000001010011110100000101110at 32 bits, wrapping
Shifted left by 11010011110100000101110= 2,746,414, no wrap
Shifted right by 110100111101000001011= 686,603, discarding the low bit
These bits as a double6.78454403 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,373,207 to the power 21,885,697,464,849
1,373,207 to the power 32,589,452,958,612,900,743
1,373,207 to the power 43,555,854,928,937,945,590,592,801
1,373,207 to the power 54,882,924,879,402,089,450,621,168,482,807
First ten multiples1,373,207, 2,746,414, 4,119,621, 5,492,828, 6,866,035, 8,239,242, 9,612,449, 10,985,656, 12,358,863, 13,732,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 2
Divisible by 4No, remainder 3
Divisible by 5No, remainder 2
Divisible by 6No, remainder 5
Divisible by 7No, remainder 3
Divisible by 8No, remainder 7
Divisible by 9No, remainder 5
Divisible by 10No, remainder 7
Divisible by 11Yes
Divisible by 12No, remainder 11
Divisible by 100No, remainder 7
Collatz (3n + 1) trajectory
Steps to reach 1106the total stopping time
Highest value reached9,269,1526× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,373,207 → 4,119,622 → 2,059,811 → 6,179,434 → 3,089,717 → 9,269,152 → 4,634,576 → 2,317,288 → 1,158,644 → 579,322 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage137,320,700%
1,373,207% as a decimal13,732.07
1,373,207% of 1001,373,207
1,373,207% of 1,00013,732,070
As a fraction of 1001,373,207/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,373,207
Nerdulate something else
Nothing in mind? Surprise me · today’s page