Recognised as Number
1,119,473
- Positive
- Odd
- Prime
- 7 digits
1,119,473 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 8.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value1,119,473
Digit count7
Digit sum26
Digit product756
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation1,119,473
Distinct prime factors11,119,473
Number of divisors2
Sum of divisors σ(n)1,119,474
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,119,472integers below n that share no factor with it
Carmichael function λ(n)1,119,472the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)−11 distinct prime factor, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 1,119,4732 in total
Arithmetic
Previous number1,119,472
Next number1,119,474
Double2,238,946
Half559,736.5
Square1,253,219,797,729
Cube1,402,945,726,623,076,817
Square root1,058.051511033≈irrational, shown to 9 decimal places
Cube root103.833591122≈
Negation-1,119,473
Reciprocal8.93277462 × 10^-7≈
Representations
Decimal1,119,473
Binary10001000101001111000121 bits
Octal4212361
Hexadecimal1114F1
Base 36NZSH
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, one hundred and nineteen thousand, four hundred and seventy-three
Ordinalone million, one hundred and nineteen thousand, four hundred and seventy-third
Scientific notation1.119473 × 10^6
Engineering notation1.119473 × 10^6
In other bases
Ternary2002212121222base 3; the most digit-efficient integer base after e: 13 digits
Quinary241310343base 5; one hand: 9 digits
Septenary12341525base 7: 8 digits
Nonary2085558base 9; each digit is two ternary digits: 7 digits
Duodecimal45ba15base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal6jiddbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal5:10:57:53base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T0100T0T0T00Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100010001010100110001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100010001010011110001
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 14 f1
Gray code110011001111010001001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100010001010011110001
64-bit0000000000000000000000000000000000000000000100010001010011110001
One's complement11111111111011101110101100001110at 32 bits, every bit flipped
Bits reversed10001111001010001000100000000000at 32 bits
Rotated left by 100000000001000100010100111100010at 32 bits, wrapping
Shifted left by 11000100010100111100010= 2,238,946, no wrap
Shifted right by 110001000101001111000= 559,736, discarding the low bit
These bits as a double5.53093151 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,119,473 to the power 21,253,219,797,729
1,119,473 to the power 31,402,945,726,623,076,817
1,119,473 to the power 41,570,559,861,419,915,673,557,441
1,119,473 to the power 51,758,199,359,743,337,258,824,369,148,593
First ten multiples1,119,473, 2,238,946, 3,358,419, 4,477,892, 5,597,365, 6,716,838, 7,836,311, 8,955,784, 10,075,257, 11,194,730
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 2
Divisible by 4No, remainder 1
Divisible by 5No, remainder 3
Divisible by 6No, remainder 5
Divisible by 7No, remainder 5
Divisible by 8No, remainder 1
Divisible by 9No, remainder 8
Divisible by 10No, remainder 3
Divisible by 11No, remainder 3
Divisible by 12No, remainder 5
Divisible by 100No, remainder 73
Collatz (3n + 1) trajectory
Steps to reach 1209the total stopping time
Highest value reached3,358,4203× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,119,473 → 3,358,420 → 1,679,210 → 839,605 → 2,518,816 → 1,259,408 → 629,704 → 314,852 → 157,426 → 78,713 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage111,947,300%
1,119,473% as a decimal11,194.73
1,119,473% of 1001,119,473
1,119,473% of 1,00011,194,730
As a fraction of 1001,119,473/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,119,473
Nerdulate something else
Nothing in mind? Surprise me · today’s page