Recognised as Number

1,117,433

Positive
Odd
Prime
7 digits

1,117,433 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 2.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value1,117,433

Digit count7

Digit sum20

Digit product252

Multiplicative persistence3times the digit product can be taken before one digit is left

Digital root2repeated digit sum

PalindromicNoreads differently backwards

Happy numberYessquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation1,117,433

Distinct prime factors11,117,433

Number of divisors2

Sum of divisors σ(n)1,117,434

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)1,117,432integers below n that share no factor with it

Carmichael function λ(n)1,117,432the 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,117,4332 in total

Arithmetic

Previous number1,117,432

Next number1,117,434

Double2,234,866

Half558,716.5

Square1,248,656,509,489

Cube1,395,289,989,367,821,737

Square root1,057.087035206≈irrational, shown to 9 decimal places

Cube root103.770481271≈

Negation-1,117,433

Reciprocal8.94908241 × 10^-7≈

Representations

Decimal1,117,433

Binary10001000011001111100121 bits

Octal4206371

Hexadecimal110CF9

Base 36NY7T

Roman numeralNot defined above 3,999there is no agreed standard notation

In wordsone million, one hundred and seventeen thousand, four hundred and thirty-three

Ordinalone million, one hundred and seventeen thousand, four hundred and thirty-third

Scientific notation1.117433 × 10^6

Engineering notation1.117433 × 10^6

In other bases

Ternary2002202211102base 3; the most digit-efficient integer base after e: 13 digits

Quinary241224213base 5; one hand: 9 digits

Septenary12332552base 7: 8 digits

Nonary2082742base 9; each digit is two ternary digits: 7 digits

Duodecimal45a7b5base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits

Vigesimal6jdbdbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits

Sexagesimal5:10:23:53base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

Balanced ternary1T010T10T1111Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed

Negabinary100010001110100001001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000000100010000110011111001

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

Bytes311 0c f9

Gray code110011000101010000101n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000000100010000110011111001

64-bit0000000000000000000000000000000000000000000100010000110011111001

One's complement11111111111011101111001100000110at 32 bits, every bit flipped

Bits reversed10011111001100001000100000000000at 32 bits

Rotated left by 100000000001000100001100111110010at 32 bits, wrapping

Shifted left by 11000100001100111110010= 2,234,866, no wrap

Shifted right by 110001000011001111100= 558,716, discarding the low bit

These bits as a double5.52085257 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime1,117,439+6

Previous prime1,117,379−54

Distance to nearest prime0, it is prime

Nearest square below1,117,249

Nearest square above1,119,364

Powers & multiples

1,117,433 to the power 21,248,656,509,489

1,117,433 to the power 31,395,289,989,367,821,737

1,117,433 to the power 41,559,143,078,689,253,147,041,121

1,117,433 to the power 51,742,237,927,848,968,211,857,600,962,393

First ten multiples1,117,433, 2,234,866, 3,352,299, 4,469,732, 5,587,165, 6,704,598, 7,822,031, 8,939,464, 10,056,897, 11,174,330

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 2

Divisible by 8No, remainder 1

Divisible by 9No, remainder 2

Divisible by 10No, remainder 3

Divisible by 11No, remainder 9

Divisible by 12No, remainder 5

Divisible by 100No, remainder 33

Collatz (3n + 1) trajectory

Steps to reach 1121the total stopping time

Highest value reached15,291,23213× the starting value

Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven

First steps1,117,433 → 3,352,300 → 1,676,150 → 838,075 → 2,514,226 → 1,257,113 → 3,771,340 → 1,885,670 → 942,835 → 2,828,506 → …

Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage111,743,300%

1,117,433% as a decimal11,174.33

1,117,433% of 1001,117,433

1,117,433% of 1,00011,174,330

As a fraction of 1001,117,433/100

Read another way

As seconds12 days, 22 hours and 23 minutes

As bytes1.066 MiB

As a 24-bit colour#110CF9

Keep nerding

Every link below is a page Nerdulator can generate from what it already knows about this value.