Recognised as Number
1,155,015
- Positive
- Odd
- Composite
- 7 digits
1,155,015 is an odd 7-digit integer and a composite number. It has 12 divisors and a digital root of 9.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,155,015
Digit count7
Digit sum18
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3^2 × 5 × 25,667
Distinct prime factors33, 5, 25,667
Number of divisors12
Sum of divisors σ(n)2,002,104
Aliquot sum847,089sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)615,984integers below n that share no factor with it
Carmichael function λ(n)153,996the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 615,984
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 3, 5, 9, 15, 45, 25,667, 77,001, 128,335, 231,003, 385,005, 1,155,01512 in total
Arithmetic
Previous number1,155,014
Next number1,155,016
Double2,310,030
Half577,507.5
Square1,334,059,650,225
Cube1,540,858,906,904,628,375
Square root1,074.716241619≈irrational, shown to 9 decimal places
Cube root104.921029056≈
Negation-1,155,015
Reciprocal8.65789622 × 10^-7≈
Representations
Decimal1,155,015
Binary10001100111111100011121 bits
Octal4317707
Hexadecimal119FC7
Base 36OR7R
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, one hundred and fifty-five thousand and fifteen
Ordinalone million, one hundred and fifty-five thousand and fifteenth
Scientific notation1.155015 × 10^6
Engineering notation1.155015 × 10^6
In other bases
Ternary2011200101100base 3; the most digit-efficient integer base after e: 13 digits
Quinary243430030base 5; one hand: 9 digits
Septenary12550251base 7: 8 digits
Nonary2150340base 9; each digit is two ternary digits: 7 digits
Duodecimal4784b3base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal747afbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal5:20:50:15base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1TTT00101100digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101101110000011011011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100011001111111000111
Bit length21 bitsto write the magnitude
Set bits13the population count, or Hamming weight
Zero bits8within that length
Bit parityodd13 set bits, so odd; 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
Bytes311 9f c7
Gray code110010101000000100100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100011001111111000111
64-bit0000000000000000000000000000000000000000000100011001111111000111
One's complement11111111111011100110000000111000at 32 bits, every bit flipped
Bits reversed11100011111110011000100000000000at 32 bits
Rotated left by 100000000001000110011111110001110at 32 bits, wrapping
Shifted left by 11000110011111110001110= 2,310,030, no wrap
Shifted right by 110001100111111100011= 577,507, discarding the low bit
These bits as a double5.70653232 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,155,015 to the power 21,334,059,650,225
1,155,015 to the power 31,540,858,906,904,628,375
1,155,015 to the power 41,779,715,150,358,449,342,550,625
1,155,015 to the power 52,055,597,694,391,264,367,386,110,134,375
First ten multiples1,155,015, 2,310,030, 3,465,045, 4,620,060, 5,775,075, 6,930,090, 8,085,105, 9,240,120, 10,395,135, 11,550,150
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 5Yes
Divisible by 6No, remainder 3
Divisible by 7No, remainder 1
Divisible by 8No, remainder 7
Divisible by 9Yes
Divisible by 10No, remainder 5
Divisible by 11No, remainder 4
Divisible by 12No, remainder 3
Divisible by 100No, remainder 15
Collatz (3n + 1) trajectory
Steps to reach 1222the total stopping time
Highest value reached7,796,3566× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,155,015 → 3,465,046 → 1,732,523 → 5,197,570 → 2,598,785 → 7,796,356 → 3,898,178 → 1,949,089 → 5,847,268 → 2,923,634 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage115,501,500%
1,155,015% as a decimal11,550.15
1,155,015% of 1001,155,015
1,155,015% of 1,00011,550,150
As a fraction of 1001,155,015/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,155,015
Nerdulate something else
Nothing in mind? Surprise me · today’s page