Nerdulator> put something in

Recognised as Number

1,790,733

  • Positive
  • Odd
  • Composite
  • 7 digits

1,790,733 is an odd 7-digit integer and a composite number. It has 16 divisors and a digital root of 3.

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,790,733
Digit count7
Digit sum30
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root3repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3 × 7 × 269 × 317
Distinct prime factors43, 7, 269, 317
Number of divisors16
Sum of divisors σ(n)2,747,520
Aliquot sum956,787sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,016,256integers below n that share no factor with it
Carmichael function λ(n)63,516the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,016,256
Möbius function μ(n)+14 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 3, 7, 21, 269, 317, 807, 951, 1,883, 2,219, 5,649, 6,657, 85,273, 255,819, 596,911, 1,790,73316 in total

Arithmetic

Previous number1,790,732
Next number1,790,734
Double3,581,466
Cube5,742,387,701,535,762,837
Square root1,338.182722949≈irrational, shown to 9 decimal places
Cube root121.434925949≈
Negation-1,790,733
Reciprocal5.58430542 × 10^-7≈

Representations

Decimal1,790,733
Binary11011010100110000110121 bits
Octal6651415
Hexadecimal1B530D
Base 3612DQL
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, seven hundred and ninety thousand, seven hundred and thirty-three
Ordinalone million, seven hundred and ninety thousand, seven hundred and thirty-third
Scientific notation1.790733 × 10^6
Engineering notation1.790733 × 10^6

In other bases

Ternary10100222102110base 3; the most digit-efficient integer base after e: 14 digits
Quinary424300413base 5; one hand: 9 digits
Septenary21135540base 7: 8 digits
Nonary3328373base 9; each digit is two ternary digits: 7 digits
Duodecimal724379base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimalb3ggdbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal8:17:25:33base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1010100T11T110digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11011110101011100011101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000000110110101001100001101
Bit length21 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits10within that length
Bit parityodd11 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
Bytes31b 53 0d
Gray code101101111101010001011n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000000110110101001100001101
64-bit0000000000000000000000000000000000000000000110110101001100001101
One's complement11111111111001001010110011110010at 32 bits, every bit flipped
Bits reversed10110000110010101101100000000000at 32 bits
Rotated left by 100000000001101101010011000011010at 32 bits, wrapping
Shifted left by 11101101010011000011010= 3,581,466, no wrap
Shifted right by 111011010100110000110= 895,366, discarding the low bit
These bits as a double8.84739656 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime1,790,743+10
Previous prime1,790,713−20
Distance to nearest prime10
Nearest square below1,790,244
Nearest square above1,792,921

Powers & multiples

1,790,733 to the power 23,206,724,677,289
1,790,733 to the power 35,742,387,701,535,762,837
1,790,733 to the power 410,283,083,155,934,241,192,389,521
1,790,733 to the power 518,414,256,349,075,591,533,171,264,108,893
First ten multiples1,790,733, 3,581,466, 5,372,199, 7,162,932, 8,953,665, 10,744,398, 12,535,131, 14,325,864, 16,116,597, 17,907,330
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 1
Divisible by 5No, remainder 3
Divisible by 6No, remainder 3
Divisible by 7Yes
Divisible by 8No, remainder 5
Divisible by 9No, remainder 3
Divisible by 10No, remainder 3
Divisible by 11No, remainder 10
Divisible by 12No, remainder 9
Divisible by 100No, remainder 33

Collatz (3n + 1) trajectory

Steps to reach 196the total stopping time
Highest value reached5,372,2003× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,790,733 → 5,372,200 → 2,686,100 → 1,343,050 → 671,525 → 2,014,576 → 1,007,288 → 503,644 → 251,822 → 125,911 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage179,073,300%
1,790,733% as a decimal17,907.33
1,790,733% of 1001,790,733
1,790,733% of 1,00017,907,330
As a fraction of 1001,790,733/100

Read another way

As bytes1.708 MiB
As a 24-bit colour#1B530D

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