Recognised as Number
7,564,091
- Positive
- Odd
- Prime
- 7 digits
7,564,091 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 5.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value7,564,091
Digit count7
Digit sum32
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation7,564,091
Distinct prime factors17,564,091
Number of divisors2
Sum of divisors σ(n)7,564,092
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)7,564,090integers below n that share no factor with it
Carmichael function λ(n)7,564,090the 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, 7,564,0912 in total
Arithmetic
Previous number7,564,090
Next number7,564,092
Double15,128,182
Half3,782,045.5
Square57,215,472,656,281
Cube432,783,041,780,121,205,571
Square root2,750.289257515≈irrational, shown to 9 decimal places
Cube root196.299374165≈
Negation-7,564,091
Reciprocal1.32203592 × 10^-7≈
Representations
Decimal7,564,091
Binary1110011011010110011101123 bits
Octal34665473
Hexadecimal736B3B
Base 364I4HN
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsseven million, five hundred and sixty-four thousand and ninety-one
Ordinalseven million, five hundred and sixty-four thousand and ninety-first
Scientific notation7.564091 × 10^6
Engineering notation7.564091 × 10^6
In other bases
Ternary112020021222112base 3; the most digit-efficient integer base after e: 15 digits
Quinary3414022331base 5; one hand: 10 digits
Septenary121202513base 7: 9 digits
Nonary15207875base 9; each digit is two ternary digits: 8 digits
Duodecimal264944bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal275a4bbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal35:1:8:11base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1TTT1T010T000TTTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101101001011111101001111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000011100110110101100111011
Bit length23 bitsto write the magnitude
Set bits15the population count, or Hamming weight
Zero bits8within that length
Bit parityodd15 set bits, so odd; 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
Bytes373 6b 3b
Gray code10010101101111010100110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000011100110110101100111011
64-bit0000000000000000000000000000000000000000011100110110101100111011
One's complement11111111100011001001010011000100at 32 bits, every bit flipped
Bits reversed11011100110101101100111000000000at 32 bits
Rotated left by 100000000111001101101011001110110at 32 bits, wrapping
Shifted left by 1111001101101011001110110= 15,128,182, no wrap
Shifted right by 11110011011010110011101= 3,782,045, discarding the low bit
These bits as a double3.73715751 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
7,564,091 to the power 257,215,472,656,281
7,564,091 to the power 3432,783,041,780,121,205,571
7,564,091 to the power 43,273,610,311,281,638,789,968,750,961
7,564,091 to the power 524,761,886,293,072,642,436,453,519,425,341,451
First ten multiples7,564,091, 15,128,182, 22,692,273, 30,256,364, 37,820,455, 45,384,546, 52,948,637, 60,512,728, 68,076,819, 75,640,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 2
Divisible by 4No, remainder 3
Divisible by 5No, remainder 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 3
Divisible by 8No, remainder 3
Divisible by 9No, remainder 5
Divisible by 10No, remainder 1
Divisible by 11No, remainder 7
Divisible by 12No, remainder 11
Divisible by 100No, remainder 91
Collatz (3n + 1) trajectory
Steps to reach 1341the total stopping time
Highest value reached106,358,02014× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps7,564,091 → 22,692,274 → 11,346,137 → 34,038,412 → 17,019,206 → 8,509,603 → 25,528,810 → 12,764,405 → 38,293,216 → 19,146,608 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage756,409,100%
7,564,091% as a decimal75,640.91
7,564,091% of 1007,564,091
7,564,091% of 1,00075,640,910
As a fraction of 1007,564,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 7,564,091
Nerdulate something else
Nothing in mind? Surprise me · today’s page