Recognised as Number
3,149,263
- Positive
- Odd
- Composite
- 7 digits
3,149,263 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 value3,149,263
Digit count7
Digit sum28
Digit product3,888
Multiplicative persistence4times 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 factorisation13 × 157 × 1,543
Distinct prime factors313, 157, 1,543
Number of divisors8
Sum of divisors σ(n)3,415,328
Aliquot sum266,065sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,886,624integers below n that share no factor with it
Carmichael function λ(n)40,092the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,886,624
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 13, 157, 1,543, 2,041, 20,059, 242,251, 3,149,2638 in total
Arithmetic
Previous number3,149,262
Next number3,149,264
Double6,298,526
Half1,574,631.5
Square9,917,857,443,169
Cube31,233,941,485,046,734,447
Square root1,774.616296555≈irrational, shown to 9 decimal places
Cube root146.578287549≈
Negation-3,149,263
Reciprocal3.1753461 × 10^-7≈
Representations
Decimal3,149,263
Binary110000000011011100111122 bits
Octal14006717
Hexadecimal300DCF
Base 361VHZJ
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, one hundred and forty-nine thousand, two hundred and sixty-three
Ordinalthree million, one hundred and forty-nine thousand, two hundred and sixty-third
Scientific notation3.149263 × 10^6
Engineering notation3.149263 × 10^6
In other bases
Ternary12220222222101base 3; the most digit-efficient integer base after e: 14 digits
Quinary1301234023base 5; one hand: 10 digits
Septenary35524345base 7: 8 digits
Nonary5828871base 9; each digit is two ternary digits: 7 digits
Duodecimal107a5a7base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimaljdd33base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal14:34:47:43base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T00T100000T101digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11100000001001011010011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001100000000110111001111
Bit length22 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits11within that length
Bit parityodd11 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 21worth 2,097,152
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes330 0d cf
Gray code1010000000101100101000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001100000000110111001111
64-bit0000000000000000000000000000000000000000001100000000110111001111
One's complement11111111110011111111001000110000at 32 bits, every bit flipped
Bits reversed11110011101100000000110000000000at 32 bits
Rotated left by 100000000011000000001101110011110at 32 bits, wrapping
Shifted left by 111000000001101110011110= 6,298,526, no wrap
Shifted right by 1110000000011011100111= 1,574,631, discarding the low bit
These bits as a double1.55594266 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,149,263 to the power 29,917,857,443,169
3,149,263 to the power 331,233,941,485,046,734,447
3,149,263 to the power 498,363,896,263,022,734,064,762,561
3,149,263 to the power 5309,773,779,036,975,764,548,996,337,142,543
First ten multiples3,149,263, 6,298,526, 9,447,789, 12,597,052, 15,746,315, 18,895,578, 22,044,841, 25,194,104, 28,343,367, 31,492,630
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
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 1
Divisible by 10No, remainder 3
Divisible by 11No, remainder 7
Divisible by 12No, remainder 7
Divisible by 100No, remainder 63
Collatz (3n + 1) trajectory
Steps to reach 1151the total stopping time
Highest value reached31,886,29610× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,149,263 → 9,447,790 → 4,723,895 → 14,171,686 → 7,085,843 → 21,257,530 → 10,628,765 → 31,886,296 → 15,943,148 → 7,971,574 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage314,926,300%
3,149,263% as a decimal31,492.63
3,149,263% of 1003,149,263
3,149,263% of 1,00031,492,630
As a fraction of 1003,149,263/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 3,149,263
Nerdulate something else
Nothing in mind? Surprise me · today’s page