Recognised as Number
3,090,791
- Positive
- Odd
- Composite
- 7 digits
3,090,791 is an odd 7-digit integer and a composite number. It has 8 divisors and a digital root of 2.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,090,791
Digit count7
Digit sum29
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberYesdivisible by its own digit sum
Factors & divisors
Prime factorisation11 × 29 × 9,689
Distinct prime factors311, 29, 9,689
Number of divisors8
Sum of divisors σ(n)3,488,400
Aliquot sum397,609sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,712,640integers below n that share no factor with it
Carmichael function λ(n)48,440the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,712,640
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 11, 29, 319, 9,689, 106,579, 280,981, 3,090,7918 in total
Arithmetic
Previous number3,090,790
Next number3,090,792
Double6,181,582
Half1,545,395.5
Square9,552,989,005,681
Cube29,526,292,441,857,783,671
Square root1,758.064560817≈irrational, shown to 9 decimal places
Cube root145.665447145≈
Negation-3,090,791
Reciprocal3.23541773 × 10^-7≈
Representations
Decimal3,090,791
Binary101111001010010110011122 bits
Octal13624547
Hexadecimal2F2967
Base 361U8VB
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, ninety thousand, seven hundred and ninety-one
Ordinalthree million, ninety thousand, seven hundred and ninety-first
Scientific notation3.090791 × 10^6
Engineering notation3.090791 × 10^6
In other bases
Ternary12211000202202base 3; the most digit-efficient integer base after e: 14 digits
Quinary1242401131base 5; one hand: 10 digits
Septenary35162024base 7: 8 digits
Nonary5730682base 9; each digit is two ternary digits: 7 digits
Duodecimal105079bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimalj66jbbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal14:18:33:11base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T0T11001T10T1Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11100110111111010111011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001011110010100101100111
Bit length22 bitsto write the magnitude
Set bits13the population count, or Hamming weight
Zero bits9within that length
Bit parityodd13 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 21worth 2,097,152
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes32f 29 67
Gray code1110001011110111010100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001011110010100101100111
64-bit0000000000000000000000000000000000000000001011110010100101100111
One's complement11111111110100001101011010011000at 32 bits, every bit flipped
Bits reversed11100110100101001111010000000000at 32 bits
Rotated left by 100000000010111100101001011001110at 32 bits, wrapping
Shifted left by 110111100101001011001110= 6,181,582, no wrap
Shifted right by 1101111001010010110011= 1,545,395, discarding the low bit
These bits as a double1.52705365 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,090,791 to the power 29,552,989,005,681
3,090,791 to the power 329,526,292,441,857,783,671
3,090,791 to the power 491,259,598,942,662,061,050,273,761
3,090,791 to the power 5282,064,347,075,589,414,335,636,688,034,951
First ten multiples3,090,791, 6,181,582, 9,272,373, 12,363,164, 15,453,955, 18,544,746, 21,635,537, 24,726,328, 27,817,119, 30,907,910
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 2
Divisible by 4No, remainder 3
Divisible by 5No, remainder 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 4
Divisible by 8No, remainder 7
Divisible by 9No, remainder 2
Divisible by 10No, remainder 1
Divisible by 11Yes
Divisible by 12No, remainder 11
Divisible by 100No, remainder 91
Collatz (3n + 1) trajectory
Steps to reach 1226the total stopping time
Highest value reached79,213,62425× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,090,791 → 9,272,374 → 4,636,187 → 13,908,562 → 6,954,281 → 20,862,844 → 10,431,422 → 5,215,711 → 15,647,134 → 7,823,567 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage309,079,100%
3,090,791% as a decimal30,907.91
3,090,791% of 1003,090,791
3,090,791% of 1,00030,907,910
As a fraction of 1003,090,791/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 3,090,791
Nerdulate something else
Nothing in mind? Surprise me · today’s page