Nerdulator> put something in

Recognised as Number

1,152,099

  • Positive
  • Odd
  • Composite
  • 7 digits

1,152,099 is an odd 7-digit integer and a composite number. It has 24 divisors and a digital root of 9.

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,152,099
Digit count7
Digit sum27
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 numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3^2 × 13 × 43 × 229
Distinct prime factors43, 13, 43, 229
Number of divisors24
Sum of divisors σ(n)1,841,840
Aliquot sum689,741sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)689,472integers below n that share no factor with it
Carmichael function λ(n)1,596the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 689,472
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 3, 9, 13, 39, 43, 117, 129, 229, 387, 559, 687, 1,677, 2,061, 2,977, 5,031, 8,931, 9,847, 26,793, 29,541, 88,623, 128,011, 384,033, 1,152,09924 in total

Arithmetic

Previous number1,152,098
Next number1,152,100
Double2,304,198
Cube1,529,217,991,761,226,299
Square root1,073.358747111≈irrational, shown to 9 decimal places
Cube root104.832658615≈
Negation-1,152,099
Reciprocal8.67980963 × 10^-7≈

Representations

Decimal1,152,099
Binary10001100101000110001121 bits
Octal4312143
Hexadecimal119463
Base 36OOYR
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, one hundred and fifty-two thousand and ninety-nine
Ordinalone million, one hundred and fifty-two thousand and ninety-ninth
Scientific notation1.152099 × 10^6
Engineering notation1.152099 × 10^6

In other bases

Ternary2011112101100base 3; the most digit-efficient integer base after e: 13 digits
Quinary243331344base 5; one hand: 9 digits
Septenary12535614base 7: 8 digits
Nonary2145340base 9; each digit is two ternary digits: 7 digits
Duodecimal476883base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal7404jbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal5:20:1:39base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1TTTTT101100digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101101001010110100111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000000100011001010001100011
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 odd
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes311 94 63
Gray code110010101111001010010n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000000100011001010001100011
64-bit0000000000000000000000000000000000000000000100011001010001100011
One's complement11111111111011100110101110011100at 32 bits, every bit flipped
Bits reversed11000110001010011000100000000000at 32 bits
Rotated left by 100000000001000110010100011000110at 32 bits, wrapping
Shifted left by 11000110010100011000110= 2,304,198, no wrap
Shifted right by 110001100101000110001= 576,049, discarding the low bit
These bits as a double5.69212537 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime1,152,113+14
Previous prime1,152,091−8
Distance to nearest prime8
Nearest square below1,151,329
Nearest square above1,153,476

Powers & multiples

1,152,099 to the power 21,327,332,105,801
1,152,099 to the power 31,529,217,991,761,226,299
1,152,099 to the power 41,761,810,519,090,117,057,851,601
1,152,099 to the power 52,029,780,137,233,204,772,233,771,660,499
First ten multiples1,152,099, 2,304,198, 3,456,297, 4,608,396, 5,760,495, 6,912,594, 8,064,693, 9,216,792, 10,368,891, 11,520,990
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 4
Divisible by 6No, remainder 3
Divisible by 7No, remainder 4
Divisible by 8No, remainder 3
Divisible by 9Yes
Divisible by 10No, remainder 9
Divisible by 11No, remainder 3
Divisible by 12No, remainder 3
Divisible by 100No, remainder 99

Collatz (3n + 1) trajectory

Steps to reach 1284the total stopping time
Highest value reached28,410,56824× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,152,099 → 3,456,298 → 1,728,149 → 5,184,448 → 2,592,224 → 1,296,112 → 648,056 → 324,028 → 162,014 → 81,007 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage115,209,900%
1,152,099% as a decimal11,520.99
1,152,099% of 1001,152,099
1,152,099% of 1,00011,520,990
As a fraction of 1001,152,099/100

Read another way

As bytes1.099 MiB
As a 24-bit colour#119463

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