Recognised as Number
5,835,091
- Positive
- Odd
- Composite
- 7 digits
5,835,091 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value5,835,091
Digit count7
Digit sum31
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation607 × 9,613
Distinct prime factors2607, 9,613
Number of divisors4
Sum of divisors σ(n)5,845,312
Aliquot sum10,221sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)5,824,872integers below n that share no factor with it
Carmichael function λ(n)970,812the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 5,824,872
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 607, 9,613, 5,835,0914 in total
Arithmetic
Previous number5,835,090
Next number5,835,092
Double11,670,182
Half2,917,545.5
Square34,048,286,978,281
Cube198,674,852,912,384,658,571
Square root2,415.593301862≈irrational, shown to 9 decimal places
Cube root180.031794795≈
Negation-5,835,091
Reciprocal1.71376933 × 10^-7≈
Representations
Decimal5,835,091
Binary1011001000010010101001123 bits
Octal26204523
Hexadecimal590953
Base 363H2DV
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfive million, eight hundred and thirty-five thousand and ninety-one
Ordinalfive million, eight hundred and thirty-five thousand and ninety-first
Scientific notation5.835091 × 10^6
Engineering notation5.835091 × 10^6
In other bases
Ternary101222110020111base 3; the most digit-efficient integer base after e: 15 digits
Quinary2443210331base 5; one hand: 10 digits
Septenary100411633base 7: 9 digits
Nonary11873214base 9; each digit is two ternary digits: 8 digits
Duodecimal1b54957base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal1g97ebbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal27:0:51:31base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary11T00T1101T0111digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101010010001100101010111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000010110010000100101010011
Bit length23 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits13within that length
Bit parityeven10 set bits, so even; not the same as the number itself being odd
Highest set bitbit 22worth 4,194,304
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes359 09 53
Gray code11101011000110111111010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000010110010000100101010011
64-bit0000000000000000000000000000000000000000010110010000100101010011
One's complement11111111101001101111011010101100at 32 bits, every bit flipped
Bits reversed11001010100100001001101000000000at 32 bits
Rotated left by 100000000101100100001001010100110at 32 bits, wrapping
Shifted left by 1101100100001001010100110= 11,670,182, no wrap
Shifted right by 11011001000010010101001= 2,917,545, discarding the low bit
These bits as a double2.882918 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
5,835,091 to the power 234,048,286,978,281
5,835,091 to the power 3198,674,852,912,384,658,571
5,835,091 to the power 41,159,285,846,155,379,509,765,714,961
5,835,091 to the power 56,764,538,407,328,639,579,018,335,477,496,451
First ten multiples5,835,091, 11,670,182, 17,505,273, 23,340,364, 29,175,455, 35,010,546, 40,845,637, 46,680,728, 52,515,819, 58,350,910
Powers of twoBetween 2^22 (4,194,304) and 2^23 (8,388,608)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 3
Divisible by 5No, remainder 1
Divisible by 6No, remainder 1
Divisible by 7No, remainder 3
Divisible by 8No, remainder 3
Divisible by 9No, remainder 4
Divisible by 10No, remainder 1
Divisible by 11No, remainder 9
Divisible by 12No, remainder 7
Divisible by 100No, remainder 91
Collatz (3n + 1) trajectory
Steps to reach 1170the total stopping time
Highest value reached74,773,52812× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps5,835,091 → 17,505,274 → 8,752,637 → 26,257,912 → 13,128,956 → 6,564,478 → 3,282,239 → 9,846,718 → 4,923,359 → 14,770,078 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage583,509,100%
5,835,091% as a decimal58,350.91
5,835,091% of 1005,835,091
5,835,091% of 1,00058,350,910
As a fraction of 1005,835,091/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 5,835,091
Nerdulate something else
Nothing in mind? Surprise me · today’s page