Recognised as Number
1,310,410
- Positive
- Even
- Composite
- 7 digits
1,310,410 is an even 7-digit integer and a composite number. It has 8 divisors and a digital root of 1.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value1,310,410
Digit count7
Digit sum10
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 numberYesdivisible by its own digit sum
Factors & divisors
Prime factorisation2 × 5 × 131,041
Distinct prime factors32, 5, 131,041
Number of divisors8
Sum of divisors σ(n)2,358,756
Aliquot sum1,048,346sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)524,160integers below n that share no factor with it
Carmichael function λ(n)131,040the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 524,160
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 5, 10, 131,041, 262,082, 655,205, 1,310,4108 in total
Arithmetic
Previous number1,310,409
Next number1,310,411
Double2,620,820
Half655,205
Square1,717,174,368,100
Cube2,250,202,463,701,921,000
Square root1,144.731409545≈irrational, shown to 9 decimal places
Cube root109.429832099≈
Negation-1,310,410
Reciprocal7.6311994 × 10^-7≈
Representations
Decimal1,310,410
Binary10011111111101100101021 bits
Octal4777312
Hexadecimal13FECA
Base 36S34A
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, three hundred and ten thousand, four hundred and ten
Ordinalone million, three hundred and ten thousand, four hundred and tenth
Scientific notation1.31041 × 10^6
Engineering notation1.31041 × 10^6
In other bases
Ternary2110120112201base 3; the most digit-efficient integer base after e: 13 digits
Quinary313413120base 5; one hand: 9 digits
Septenary14065303base 7: 8 digits
Nonary2416481base 9; each digit is two ternary digits: 7 digits
Duodecimal53240abase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal83g0abase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal6:4:0:10base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T111TT1TT0T01digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101000000001111011110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100111111111011001010
Bit length21 bitsto write the magnitude
Set bits14the population count, or Hamming weight
Zero bits7within that length
Bit parityeven14 set bits, so even; not the same as the number itself being even
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes313 fe ca
Gray code110100000000110101111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100111111111011001010
64-bit0000000000000000000000000000000000000000000100111111111011001010
One's complement11111111111011000000000100110101at 32 bits, every bit flipped
Bits reversed01010011011111111100100000000000at 32 bits
Rotated left by 100000000001001111111110110010100at 32 bits, wrapping
Shifted left by 11001111111110110010100= 2,620,820, no wrap
Shifted right by 110011111111101100101= 655,205, discarding the low bit
These bits as a double6.47428563 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,310,410 to the power 21,717,174,368,100
1,310,410 to the power 32,250,202,463,701,921,000
1,310,410 to the power 42,948,687,810,459,634,297,610,000
1,310,410 to the power 53,863,989,993,704,409,379,931,120,100,000
First ten multiples1,310,410, 2,620,820, 3,931,230, 5,241,640, 6,552,050, 7,862,460, 9,172,870, 10,483,280, 11,793,690, 13,104,100
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 1
Divisible by 4No, remainder 2
Divisible by 5Yes
Divisible by 6No, remainder 4
Divisible by 7No, remainder 3
Divisible by 8No, remainder 2
Divisible by 9No, remainder 1
Divisible by 10Yes
Divisible by 11No, remainder 2
Divisible by 12No, remainder 10
Divisible by 100No, remainder 10
Collatz (3n + 1) trajectory
Steps to reach 1142the total stopping time
Highest value reached1,965,6161× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,310,410 → 655,205 → 1,965,616 → 982,808 → 491,404 → 245,702 → 122,851 → 368,554 → 184,277 → 552,832 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage131,041,000%
1,310,410% as a decimal13,104.1
1,310,410% of 1001,310,410
1,310,410% of 1,00013,104,100
As a fraction of 1001,310,410/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,310,410
Nerdulate something else
Nothing in mind? Surprise me · today’s page