Recognised as Number
1,335,638
- Positive
- Even
- Composite
- 7 digits
1,335,638 is an even 7-digit integer and a composite number. It has 4 divisors and a digital root of 2.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value1,335,638
Digit count7
Digit sum29
Digit product6,480
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2 × 667,819
Distinct prime factors22, 667,819
Number of divisors4
Sum of divisors σ(n)2,003,460
Aliquot sum667,822sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)667,818integers below n that share no factor with it
Carmichael function λ(n)667,818the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 667,819, 1,335,6384 in total
Arithmetic
Previous number1,335,637
Next number1,335,639
Double2,671,276
Half667,819
Square1,783,928,867,044
Cube2,382,683,184,120,914,072
Square root1,155.698057453≈irrational, shown to 9 decimal places
Cube root110.127620474≈
Negation-1,335,638
Reciprocal7.48705862 × 10^-7≈
Representations
Decimal1,335,638
Binary10100011000010101011021 bits
Octal5060526
Hexadecimal146156
Base 36SML2
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, three hundred and thirty-five thousand, six hundred and thirty-eight
Ordinalone million, three hundred and thirty-five thousand, six hundred and thirty-eighth
Scientific notation1.335638 × 10^6
Engineering notation1.335638 × 10^6
In other bases
Ternary2111212011002base 3; the most digit-efficient integer base after e: 13 digits
Quinary320220023base 5; one hand: 9 digits
Septenary14231663base 7: 8 digits
Nonary2455132base 9; each digit is two ternary digits: 7 digits
Duodecimal544b32base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal86j1ibase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal6:11:0:38base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10TTT0TT01101Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101011010011010101010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000101000110000101010110
Bit length21 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits12within that length
Bit parityodd9 set bits, so odd; 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
Bytes314 61 56
Gray code111100101000111111101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000101000110000101010110
64-bit0000000000000000000000000000000000000000000101000110000101010110
One's complement11111111111010111001111010101001at 32 bits, every bit flipped
Bits reversed01101010100001100010100000000000at 32 bits
Rotated left by 100000000001010001100001010101100at 32 bits, wrapping
Shifted left by 11010001100001010101100= 2,671,276, no wrap
Shifted right by 110100011000010101011= 667,819, discarding the low bit
These bits as a double6.59892851 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,335,638 to the power 21,783,928,867,044
1,335,638 to the power 32,382,683,184,120,914,072
1,335,638 to the power 43,182,402,202,672,889,429,297,936
1,335,638 to the power 54,250,537,313,173,612,691,568,636,643,168
First ten multiples1,335,638, 2,671,276, 4,006,914, 5,342,552, 6,678,190, 8,013,828, 9,349,466, 10,685,104, 12,020,742, 13,356,380
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 2
Divisible by 4No, remainder 2
Divisible by 5No, remainder 3
Divisible by 6No, remainder 2
Divisible by 7No, remainder 3
Divisible by 8No, remainder 6
Divisible by 9No, remainder 2
Divisible by 10No, remainder 8
Divisible by 11No, remainder 7
Divisible by 12No, remainder 2
Divisible by 100No, remainder 38
Collatz (3n + 1) trajectory
Steps to reach 1155the total stopping time
Highest value reached3,005,1882× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,335,638 → 667,819 → 2,003,458 → 1,001,729 → 3,005,188 → 1,502,594 → 751,297 → 2,253,892 → 1,126,946 → 563,473 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage133,563,800%
1,335,638% as a decimal13,356.38
1,335,638% of 1001,335,638
1,335,638% of 1,00013,356,380
As a fraction of 1001,335,638/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,335,638
Nerdulate something else
Nothing in mind? Surprise me · today’s page