Recognised as Number
1,371,061
- Positive
- Odd
- Prime
- 7 digits
1,371,061 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,371,061
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 numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation1,371,061
Distinct prime factors11,371,061
Number of divisors2
Sum of divisors σ(n)1,371,062
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,371,060integers below n that share no factor with it
Carmichael function λ(n)1,371,060the 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,371,0612 in total
Arithmetic
Previous number1,371,060
Next number1,371,062
Double2,742,122
Half685,530.5
Square1,879,808,265,721
Cube2,577,331,800,607,699,981
Square root1,170.923140091≈irrational, shown to 9 decimal places
Cube root111.092718029≈
Negation-1,371,061
Reciprocal7.29362151 × 10^-7≈
Representations
Decimal1,371,061
Binary10100111010111011010121 bits
Octal5165665
Hexadecimal14EBB5
Base 36TDX1
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, three hundred and seventy-one thousand and sixty-one
Ordinalone million, three hundred and seventy-one thousand and sixty-first
Scientific notation1.371061 × 10^6
Engineering notation1.371061 × 10^6
In other bases
Ternary2120122202001base 3; the most digit-efficient integer base after e: 13 digits
Quinary322333221base 5; one hand: 9 digits
Septenary14440156base 7: 8 digits
Nonary2518661base 9; each digit is two ternary digits: 7 digits
Duodecimal561531base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal8b7d1base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal6:20:51:1base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10TT1T00T1T001digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101010011110011110101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000101001110101110110101
Bit length21 bitsto write the magnitude
Set bits13the population count, or Hamming weight
Zero bits8within that length
Bit parityodd13 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 eb b5
Gray code111101001111001101111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000101001110101110110101
64-bit0000000000000000000000000000000000000000000101001110101110110101
One's complement11111111111010110001010001001010at 32 bits, every bit flipped
Bits reversed10101101110101110010100000000000at 32 bits
Rotated left by 100000000001010011101011101101010at 32 bits, wrapping
Shifted left by 11010011101011101101010= 2,742,122, no wrap
Shifted right by 110100111010111011010= 685,530, discarding the low bit
These bits as a double6.77394138 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,371,061 to the power 21,879,808,265,721
1,371,061 to the power 32,577,331,800,607,699,981
1,371,061 to the power 43,533,679,115,872,993,743,649,841
1,371,061 to the power 54,844,889,622,287,942,675,162,294,651,301
First ten multiples1,371,061, 2,742,122, 4,113,183, 5,484,244, 6,855,305, 8,226,366, 9,597,427, 10,968,488, 12,339,549, 13,710,610
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 1
Divisible by 6No, remainder 1
Divisible by 7No, remainder 6
Divisible by 8No, remainder 5
Divisible by 9No, remainder 1
Divisible by 10No, remainder 1
Divisible by 11No, remainder 10
Divisible by 12No, remainder 1
Divisible by 100No, remainder 61
Collatz (3n + 1) trajectory
Steps to reach 1199the total stopping time
Highest value reached4,113,1843× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,371,061 → 4,113,184 → 2,056,592 → 1,028,296 → 514,148 → 257,074 → 128,537 → 385,612 → 192,806 → 96,403 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage137,106,100%
1,371,061% as a decimal13,710.61
1,371,061% of 1001,371,061
1,371,061% of 1,00013,710,610
As a fraction of 1001,371,061/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,371,061
Nerdulate something else
Nothing in mind? Surprise me · today’s page