Recognised as Number
1,314,955
- Positive
- Odd
- Composite
- 7 digits
1,314,955 is an odd 7-digit integer and a composite number. It has 8 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,314,955
Digit count7
Digit sum28
Digit product2,700
Multiplicative persistence2times 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 factorisation5 × 79 × 3,329
Distinct prime factors35, 79, 3,329
Number of divisors8
Sum of divisors σ(n)1,598,400
Aliquot sum283,445sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,038,336integers below n that share no factor with it
Carmichael function λ(n)9,984the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,038,336
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 5, 79, 395, 3,329, 16,645, 262,991, 1,314,9558 in total
Arithmetic
Previous number1,314,954
Next number1,314,956
Double2,629,910
Half657,477.5
Square1,729,106,652,025
Cube2,273,697,437,613,533,875
Square root1,146.714873018≈irrational, shown to 9 decimal places
Cube root109.556200864≈
Negation-1,314,955
Reciprocal7.60482298 × 10^-7≈
Representations
Decimal1,314,955
Binary10100000100001000101121 bits
Octal5010213
Hexadecimal14108B
Base 36S6MJ
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, three hundred and fourteen thousand, nine hundred and fifty-five
Ordinalone million, three hundred and fourteen thousand, nine hundred and fifty-fifth
Scientific notation1.314955 × 10^6
Engineering notation1.314955 × 10^6
In other bases
Ternary2110210210001base 3; the most digit-efficient integer base after e: 13 digits
Quinary314034310base 5; one hand: 9 digits
Septenary14114455base 7: 8 digits
Nonary2423701base 9; each digit is two ternary digits: 7 digits
Duodecimal534b77base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal8477fbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal6:5:15:55base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T111T11T10001digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101000001000110011111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000101000001000010001011
Bit length21 bitsto write the magnitude
Set bits7the population count, or Hamming weight
Zero bits14within that length
Bit parityodd7 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 10 8b
Gray code111100001100011001110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000101000001000010001011
64-bit0000000000000000000000000000000000000000000101000001000010001011
One's complement11111111111010111110111101110100at 32 bits, every bit flipped
Bits reversed11010001000010000010100000000000at 32 bits
Rotated left by 100000000001010000010000100010110at 32 bits, wrapping
Shifted left by 11010000010000100010110= 2,629,910, no wrap
Shifted right by 110100000100001000101= 657,477, discarding the low bit
These bits as a double6.49674091 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,314,955 to the power 21,729,106,652,025
1,314,955 to the power 32,273,697,437,613,533,875
1,314,955 to the power 42,989,809,814,077,104,436,600,625
1,314,955 to the power 53,931,465,364,069,758,864,430,174,846,875
First ten multiples1,314,955, 2,629,910, 3,944,865, 5,259,820, 6,574,775, 7,889,730, 9,204,685, 10,519,640, 11,834,595, 13,149,550
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 5Yes
Divisible by 6No, remainder 1
Divisible by 7No, remainder 5
Divisible by 8No, remainder 3
Divisible by 9No, remainder 1
Divisible by 10No, remainder 5
Divisible by 11No, remainder 4
Divisible by 12No, remainder 7
Divisible by 100No, remainder 55
Collatz (3n + 1) trajectory
Steps to reach 1186the total stopping time
Highest value reached5,917,3004× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,314,955 → 3,944,866 → 1,972,433 → 5,917,300 → 2,958,650 → 1,479,325 → 4,437,976 → 2,218,988 → 1,109,494 → 554,747 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage131,495,500%
1,314,955% as a decimal13,149.55
1,314,955% of 1001,314,955
1,314,955% of 1,00013,149,550
As a fraction of 1001,314,955/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,314,955
Nerdulate something else
Nothing in mind? Surprise me · today’s page