Recognised as Number
1,263,463
- Positive
- Odd
- Prime
- 7 digits
1,263,463 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value1,263,463
Digit count7
Digit sum25
Digit product2,592
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation1,263,463
Distinct prime factors11,263,463
Number of divisors2
Sum of divisors σ(n)1,263,464
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,263,462integers below n that share no factor with it
Carmichael function λ(n)1,263,462the 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,263,4632 in total
Arithmetic
Previous number1,263,462
Next number1,263,464
Double2,526,926
Half631,731.5
Square1,596,338,752,369
Cube2,016,914,949,084,393,847
Square root1,124.038700401≈irrational, shown to 9 decimal places
Cube root108.107089708≈
Negation-1,263,463
Reciprocal7.91475492 × 10^-7≈
Representations
Decimal1,263,463
Binary10011010001110110011121 bits
Octal4643547
Hexadecimal134767
Base 36R2W7
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, two hundred and sixty-three thousand, four hundred and sixty-three
Ordinalone million, two hundred and sixty-three thousand, four hundred and sixty-third
Scientific notation1.263463 × 10^6
Engineering notation1.263463 × 10^6
In other bases
Ternary2101012010221base 3; the most digit-efficient integer base after e: 13 digits
Quinary310412323base 5; one hand: 9 digits
Septenary13511365base 7: 8 digits
Nonary2335127base 9; each digit is two ternary digits: 7 digits
Duodecimal50b207base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal7hid3base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal5:50:57:43base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1011TT0110T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101110101100010111011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100110100011101100111
Bit length21 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits9within that length
Bit parityeven12 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
Bytes313 47 67
Gray code110101110010011010100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100110100011101100111
64-bit0000000000000000000000000000000000000000000100110100011101100111
One's complement11111111111011001011100010011000at 32 bits, every bit flipped
Bits reversed11100110111000101100100000000000at 32 bits
Rotated left by 100000000001001101000111011001110at 32 bits, wrapping
Shifted left by 11001101000111011001110= 2,526,926, no wrap
Shifted right by 110011010001110110011= 631,731, discarding the low bit
These bits as a double6.24233663 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,263,463 to the power 21,596,338,752,369
1,263,463 to the power 32,016,914,949,084,393,847
1,263,463 to the power 42,548,297,412,315,015,503,112,161
1,263,463 to the power 53,219,679,493,455,766,432,608,600,273,543
First ten multiples1,263,463, 2,526,926, 3,790,389, 5,053,852, 6,317,315, 7,580,778, 8,844,241, 10,107,704, 11,371,167, 12,634,630
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 5No, remainder 3
Divisible by 6No, remainder 1
Divisible by 7No, remainder 5
Divisible by 8No, remainder 7
Divisible by 9No, remainder 7
Divisible by 10No, remainder 3
Divisible by 11No, remainder 3
Divisible by 12No, remainder 7
Divisible by 100No, remainder 63
Collatz (3n + 1) trajectory
Steps to reach 1155the total stopping time
Highest value reached72,857,71657× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,263,463 → 3,790,390 → 1,895,195 → 5,685,586 → 2,842,793 → 8,528,380 → 4,264,190 → 2,132,095 → 6,396,286 → 3,198,143 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage126,346,300%
1,263,463% as a decimal12,634.63
1,263,463% of 1001,263,463
1,263,463% of 1,00012,634,630
As a fraction of 1001,263,463/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,263,463
Nerdulate something else
Nothing in mind? Surprise me · today’s page