Recognised as Number
1,138,696
- Positive
- Even
- Composite
- 7 digits
1,138,696 is an even 7-digit integer and a composite number. It has 16 divisors and a digital root of 7.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value1,138,696
Digit count7
Digit sum34
Digit product7,776
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 factorisation2^3 × 13 × 10,949
Distinct prime factors32, 13, 10,949
Number of divisors16
Sum of divisors σ(n)2,299,500
Aliquot sum1,160,804sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)525,504integers below n that share no factor with it
Carmichael function λ(n)32,844the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 525,504
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 8, 13, 26, 52, 104, 10,949, 21,898, 43,796, 87,592, 142,337, 284,674, 569,348, 1,138,69616 in total
Arithmetic
Previous number1,138,695
Next number1,138,697
Double2,277,392
Half569,348
Square1,296,628,580,416
Cube1,476,465,778,005,377,536
Square root1,067.096996528≈irrational, shown to 9 decimal places
Cube root104.424546618≈
Negation-1,138,696
Reciprocal8.78197517 × 10^-7≈
Representations
Decimal1,138,696
Binary10001011000000000100021 bits
Octal4260010
Hexadecimal116008
Base 36OEMG
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, one hundred and thirty-eight thousand, six hundred and ninety-six
Ordinalone million, one hundred and thirty-eight thousand, six hundred and ninety-sixth
Scientific notation1.138696 × 10^6
Engineering notation1.138696 × 10^6
In other bases
Ternary2010211222221base 3; the most digit-efficient integer base after e: 13 digits
Quinary242414241base 5; one hand: 9 digits
Septenary12451546base 7: 8 digits
Nonary2124887base 9; each digit is two ternary digits: 7 digits
Duodecimal46ab74base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal726egbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal5:16:18:16base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T0110TT0000T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101101010000000011000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100010110000000001000
Bit length21 bitsto write the magnitude
Set bits5the population count, or Hamming weight
Zero bits16within that length
Bit parityodd5 set bits, so odd; not the same as the number itself being even
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 33 trailing zeros
Power of twoNo
Bytes311 60 08
Gray code110011101000000001100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100010110000000001000
64-bit0000000000000000000000000000000000000000000100010110000000001000
One's complement11111111111011101001111111110111at 32 bits, every bit flipped
Bits reversed00010000000001101000100000000000at 32 bits
Rotated left by 100000000001000101100000000010000at 32 bits, wrapping
Shifted left by 11000101100000000010000= 2,277,392, no wrap
Shifted right by 110001011000000000100= 569,348, discarding the low bit
These bits as a double5.62590575 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,138,696 to the power 21,296,628,580,416
1,138,696 to the power 31,476,465,778,005,377,536
1,138,696 to the power 41,681,245,675,551,611,378,733,056
1,138,696 to the power 51,914,427,725,767,917,670,517,815,934,976
First ten multiples1,138,696, 2,277,392, 3,416,088, 4,554,784, 5,693,480, 6,832,176, 7,970,872, 9,109,568, 10,248,264, 11,386,960
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 4Yes
Divisible by 5No, remainder 1
Divisible by 6No, remainder 4
Divisible by 7No, remainder 6
Divisible by 8Yes
Divisible by 9No, remainder 7
Divisible by 10No, remainder 6
Divisible by 11No, remainder 9
Divisible by 12No, remainder 4
Divisible by 100No, remainder 96
Collatz (3n + 1) trajectory
Steps to reach 177the total stopping time
Highest value reached1,138,696
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,138,696 → 569,348 → 284,674 → 142,337 → 427,012 → 213,506 → 106,753 → 320,260 → 160,130 → 80,065 → …
Last steps… → 32 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage113,869,600%
1,138,696% as a decimal11,386.96
1,138,696% of 1001,138,696
1,138,696% of 1,00011,386,960
As a fraction of 1001,138,696/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,138,696
Nerdulate something else
Nothing in mind? Surprise me · today’s page