Recognised as Number
3,564,971
- Positive
- Odd
- Prime
- 7 digits
3,564,971 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 8.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value3,564,971
Digit count7
Digit sum35
Digit product22,680
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3,564,971
Distinct prime factors13,564,971
Number of divisors2
Sum of divisors σ(n)3,564,972
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,564,970integers below n that share no factor with it
Carmichael function λ(n)3,564,970the 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, 3,564,9712 in total
Arithmetic
Previous number3,564,970
Next number3,564,972
Double7,129,942
Half1,782,485.5
Square12,709,018,230,841
Cube45,307,281,431,419,470,611
Square root1,888.113079241≈irrational, shown to 9 decimal places
Cube root152.763171844≈
Negation-3,564,971
Reciprocal2.80507191 × 10^-7≈
Representations
Decimal3,564,971
Binary110110011001011010101122 bits
Octal15462653
Hexadecimal3665AB
Base 3624EQZ
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, five hundred and sixty-four thousand, nine hundred and seventy-one
Ordinalthree million, five hundred and sixty-four thousand, nine hundred and seventy-first
Scientific notation3.564971 × 10^6
Engineering notation3.564971 × 10^6
In other bases
Ternary20201010012222base 3; the most digit-efficient integer base after e: 14 digits
Quinary1403034341base 5; one hand: 10 digits
Septenary42205334base 7: 8 digits
Nonary6633188base 9; each digit is two ternary digits: 7 digits
Duodecimal123b08bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal125c8bbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal16:30:16:11base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1T010101T000Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10010111011101011111111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001101100110010110101011
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
Bytes336 65 ab
Gray code1011010101011101111110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001101100110010110101011
64-bit0000000000000000000000000000000000000000001101100110010110101011
One's complement11111111110010011001101001010100at 32 bits, every bit flipped
Bits reversed11010101101001100110110000000000at 32 bits
Rotated left by 100000000011011001100101101010110at 32 bits, wrapping
Shifted left by 111011001100101101010110= 7,129,942, no wrap
Shifted right by 1110110011001011010101= 1,782,485, discarding the low bit
These bits as a double1.7613297 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,564,971 to the power 212,709,018,230,841
3,564,971 to the power 345,307,281,431,419,470,611
3,564,971 to the power 4161,519,144,391,848,901,563,567,281
3,564,971 to the power 5575,811,065,701,753,970,455,972,013,313,851
First ten multiples3,564,971, 7,129,942, 10,694,913, 14,259,884, 17,824,855, 21,389,826, 24,954,797, 28,519,768, 32,084,739, 35,649,710
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 3
Divisible by 9No, remainder 8
Divisible by 10No, remainder 1
Divisible by 11No, remainder 3
Divisible by 12No, remainder 11
Divisible by 100No, remainder 71
Collatz (3n + 1) trajectory
Steps to reach 1146the total stopping time
Highest value reached16,042,3724× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,564,971 → 10,694,914 → 5,347,457 → 16,042,372 → 8,021,186 → 4,010,593 → 12,031,780 → 6,015,890 → 3,007,945 → 9,023,836 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage356,497,100%
3,564,971% as a decimal35,649.71
3,564,971% of 1003,564,971
3,564,971% of 1,00035,649,710
As a fraction of 1003,564,971/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,564,971
Nerdulate something else
Nothing in mind? Surprise me · today’s page