Nerdulator> put something in

Recognised as Number

2,015,331

  • Positive
  • Odd
  • Composite
  • 7 digits

2,015,331 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 6.

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value2,015,331
Digit count7
Digit sum15
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root6repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3 × 671,777
Distinct prime factors23, 671,777
Number of divisors4
Sum of divisors σ(n)2,687,112
Aliquot sum671,781sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,343,552integers below n that share no factor with it
Carmichael function λ(n)671,776the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,343,552
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 3, 671,777, 2,015,3314 in total

Arithmetic

Previous number2,015,330
Next number2,015,332
Double4,030,662
Cube8,185,385,840,757,509,691
Square root1,419.623541648≈irrational, shown to 9 decimal places
Cube root126.313216715≈
Negation-2,015,331
Reciprocal4.96196406 × 10^-7≈

Representations

Decimal2,015,331
Binary11110110000000110001121 bits
Octal7540143
Hexadecimal1EC063
Base 361771F
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, fifteen thousand, three hundred and thirty-one
Ordinaltwo million, fifteen thousand, three hundred and thirty-first
Scientific notation2.015331 × 10^6
Engineering notation2.015331 × 10^6

In other bases

Ternary10210101111220base 3; the most digit-efficient integer base after e: 14 digits
Quinary1003442311base 5; one hand: 10 digits
Septenary23062413base 7: 8 digits
Nonary3711456base 9; each digit is two ternary digits: 7 digits
Duodecimal812343base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimalcbi6bbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal9:19:48:51base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary11T1011TTTT0T0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11000111100000110100111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000000111101100000001100011
Bit length21 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits11within that length
Bit parityeven10 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
Bytes31e c0 63
Gray code100011010000001010010n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000000111101100000001100011
64-bit0000000000000000000000000000000000000000000111101100000001100011
One's complement11111111111000010011111110011100at 32 bits, every bit flipped
Bits reversed11000110000000110111100000000000at 32 bits
Rotated left by 100000000001111011000000011000110at 32 bits, wrapping
Shifted left by 11111011000000011000110= 4,030,662, no wrap
Shifted right by 111110110000000110001= 1,007,665, discarding the low bit
These bits as a double9.95705812 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime2,015,339+8
Previous prime2,015,317−14
Distance to nearest prime8
Nearest square below2,013,561
Nearest square above2,016,400

Powers & multiples

2,015,331 to the power 24,061,559,039,561
2,015,331 to the power 38,185,385,840,757,509,691
2,015,331 to the power 416,496,261,831,839,672,763,072,721
2,015,331 to the power 533,245,427,853,823,279,549,276,109,885,651
First ten multiples2,015,331, 4,030,662, 6,045,993, 8,061,324, 10,076,655, 12,091,986, 14,107,317, 16,122,648, 18,137,979, 20,153,310
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)

Divisibility tests

Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 3
Divisible by 5No, remainder 1
Divisible by 6No, remainder 3
Divisible by 7No, remainder 3
Divisible by 8No, remainder 3
Divisible by 9No, remainder 6
Divisible by 10No, remainder 1
Divisible by 11No, remainder 10
Divisible by 12No, remainder 3
Divisible by 100No, remainder 31

Collatz (3n + 1) trajectory

Steps to reach 191the total stopping time
Highest value reached9,068,9924× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,015,331 → 6,045,994 → 3,022,997 → 9,068,992 → 4,534,496 → 2,267,248 → 1,133,624 → 566,812 → 283,406 → 141,703 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage201,533,100%
2,015,331% as a decimal20,153.31
2,015,331% of 1002,015,331
2,015,331% of 1,00020,153,310
As a fraction of 1002,015,331/100

Read another way

As bytes1.922 MiB
As a 24-bit colour#1EC063

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 “2015331” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.