Recognised as Number
1,199,752
- Positive
- Even
- Composite
- 7 digits
1,199,752 is an even 7-digit integer and a composite number. It has 8 divisors and a digital root of 7.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value1,199,752
Digit count7
Digit sum34
Digit product5,670
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2^3 × 149,969
Distinct prime factors22, 149,969
Number of divisors8
Sum of divisors σ(n)2,249,550
Aliquot sum1,049,798sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)599,872integers below n that share no factor with it
Carmichael function λ(n)149,968the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 599,872
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 8, 149,969, 299,938, 599,876, 1,199,7528 in total
Arithmetic
Previous number1,199,751
Next number1,199,753
Double2,399,504
Half599,876
Square1,439,404,861,504
Cube1,726,928,861,399,147,008
Square root1,095.331913166≈irrational, shown to 9 decimal places
Cube root106.258535877≈
Negation-1,199,752
Reciprocal8.33505591 × 10^-7≈
Representations
Decimal1,199,752
Binary10010010011101000100021 bits
Octal4447210
Hexadecimal124E88
Base 36PPQG
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, one hundred and ninety-nine thousand, seven hundred and fifty-two
Ordinalone million, one hundred and ninety-nine thousand, seven hundred and fifty-second
Scientific notation1.199752 × 10^6
Engineering notation1.199752 × 10^6
In other bases
Ternary2020221202021base 3; the most digit-efficient integer base after e: 13 digits
Quinary301343002base 5; one hand: 9 digits
Septenary13124551base 7: 8 digits
Nonary2227667base 9; each digit is two ternary digits: 7 digits
Duodecimal49a374base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal79j7cbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal5:33:15:52base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1T100TT1T1T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101100101001110011000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100100100111010001000
Bit length21 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits13within that length
Bit parityeven8 set bits, so even; not the same as the number itself being even
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 33 trailing zeros
Power of twoNo
Bytes312 4e 88
Gray code110110110100111001100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100100100111010001000
64-bit0000000000000000000000000000000000000000000100100100111010001000
One's complement11111111111011011011000101110111at 32 bits, every bit flipped
Bits reversed00010001011100100100100000000000at 32 bits
Rotated left by 100000000001001001001110100010000at 32 bits, wrapping
Shifted left by 11001001001110100010000= 2,399,504, no wrap
Shifted right by 110010010011101000100= 599,876, discarding the low bit
These bits as a double5.92756247 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,199,752 to the power 21,439,404,861,504
1,199,752 to the power 31,726,928,861,399,147,008
1,199,752 to the power 42,071,886,355,321,349,421,142,016
1,199,752 to the power 52,485,749,798,569,499,610,713,975,980,032
First ten multiples1,199,752, 2,399,504, 3,599,256, 4,799,008, 5,998,760, 7,198,512, 8,398,264, 9,598,016, 10,797,768, 11,997,520
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 7No, remainder 1
Divisible by 8Yes
Divisible by 9No, remainder 7
Divisible by 10No, remainder 2
Divisible by 11No, remainder 4
Divisible by 12No, remainder 4
Divisible by 100No, remainder 52
Collatz (3n + 1) trajectory
Steps to reach 154the total stopping time
Highest value reached1,199,752
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,199,752 → 599,876 → 299,938 → 149,969 → 449,908 → 224,954 → 112,477 → 337,432 → 168,716 → 84,358 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage119,975,200%
1,199,752% as a decimal11,997.52
1,199,752% of 1001,199,752
1,199,752% of 1,00011,997,520
As a fraction of 1001,199,752/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,199,752
Nerdulate something else
Nothing in mind? Surprise me · today’s page