Nerdulator> put something in

Recognised as Number

1,335,292

  • Positive
  • Even
  • Composite
  • 7 digits

1,335,292 is an even 7-digit integer and a composite number. It has 24 divisors and a digital root of 7.

Number properties

ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value1,335,292
Digit count7
Digit sum25
Digit product1,620
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2^2 × 7 × 103 × 463
Distinct prime factors42, 7, 103, 463
Number of divisors24
Sum of divisors σ(n)2,702,336
Aliquot sum1,367,044sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)565,488integers below n that share no factor with it
Carmichael function λ(n)7,854the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 565,488
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 7, 14, 28, 103, 206, 412, 463, 721, 926, 1,442, 1,852, 2,884, 3,241, 6,482, 12,964, 47,689, 95,378, 190,756, 333,823, 667,646, 1,335,29224 in total

Arithmetic

Previous number1,335,291
Next number1,335,293
Double2,670,584
Cube2,380,831,945,607,217,088
Square root1,155.548354678≈irrational, shown to 9 decimal places
Cube root110.118110051≈
Negation-1,335,292
Reciprocal7.48899866 × 10^-7≈

Representations

Decimal1,335,292
Binary10100010111111111110021 bits
Octal5057774
Hexadecimal145FFC
Base 36SMBG
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, three hundred and thirty-five thousand, two hundred and ninety-two
Ordinalone million, three hundred and thirty-five thousand, two hundred and ninety-second
Scientific notation1.335292 × 10^6
Engineering notation1.335292 × 10^6

In other bases

Ternary2111211200021base 3; the most digit-efficient integer base after e: 13 digits
Quinary320212132base 5; one hand: 9 digits
Septenary14230660base 7: 8 digits
Nonary2454607base 9; each digit is two ternary digits: 7 digits
Duodecimal5448a4base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal86i4cbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal6:10:54:52base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10TTT0TTT001T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101011010000000001100base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000000101000101111111111100
Bit length21 bitsto write the magnitude
Set bits14the population count, or Hamming weight
Zero bits7within that length
Bit parityeven14 set bits, so even; not the same as the number itself being even
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 22 trailing zeros
Power of twoNo
Bytes314 5f fc
Gray code111100111000000000010n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000000101000101111111111100
64-bit0000000000000000000000000000000000000000000101000101111111111100
One's complement11111111111010111010000000000011at 32 bits, every bit flipped
Bits reversed00111111111110100010100000000000at 32 bits
Rotated left by 100000000001010001011111111111000at 32 bits, wrapping
Shifted left by 11010001011111111111000= 2,670,584, no wrap
Shifted right by 110100010111111111110= 667,646, discarding the low bit
These bits as a double6.59721904 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime1,335,319+27
Previous prime1,335,289−3
Distance to nearest prime3
Nearest square below1,334,025
Nearest square above1,336,336

Powers & multiples

1,335,292 to the power 21,783,004,725,264
1,335,292 to the power 32,380,831,945,607,217,088
1,335,292 to the power 43,179,105,850,313,752,119,869,696
1,335,292 to the power 54,245,034,609,077,150,695,645,046,111,232
First ten multiples1,335,292, 2,670,584, 4,005,876, 5,341,168, 6,676,460, 8,011,752, 9,347,044, 10,682,336, 12,017,628, 13,352,920
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 2
Divisible by 6No, remainder 4
Divisible by 7Yes
Divisible by 8No, remainder 4
Divisible by 9No, remainder 7
Divisible by 10No, remainder 2
Divisible by 11No, remainder 2
Divisible by 12No, remainder 4
Divisible by 100No, remainder 92

Collatz (3n + 1) trajectory

Steps to reach 1142the total stopping time
Highest value reached57,749,92043× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,335,292 → 667,646 → 333,823 → 1,001,470 → 500,735 → 1,502,206 → 751,103 → 2,253,310 → 1,126,655 → 3,379,966 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage133,529,200%
1,335,292% as a decimal13,352.92
1,335,292% of 1001,335,292
1,335,292% of 1,00013,352,920
As a fraction of 1001,335,292/100

Read another way

As bytes1.273 MiB
As a 24-bit colour#145FFC

Keep nerding

Every link below is a page Nerdulator can generate from what it already knows about this value.

Nerdulate something else

Nothing in mind? Surprise me · today’s page

Every value on this page was computed from “1335292” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.