Recognised as Number
3,574,013
- Positive
- Odd
- Prime
- 7 digits
3,574,013 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 value3,574,013
Digit count7
Digit sum23
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 factorisation3,574,013
Distinct prime factors13,574,013
Number of divisors2
Sum of divisors σ(n)3,574,014
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,574,012integers below n that share no factor with it
Carmichael function λ(n)3,574,012the 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,574,0132 in total
Arithmetic
Previous number3,574,012
Next number3,574,014
Double7,148,026
Half1,787,006.5
Square12,773,568,924,169
Cube45,652,901,391,376,020,197
Square root1,890.506016917≈irrational, shown to 9 decimal places
Cube root152.892216226≈
Negation-3,574,013
Reciprocal2.79797527 × 10^-7≈
Representations
Decimal3,574,013
Binary110110100010001111110122 bits
Octal15504375
Hexadecimal3688FD
Base 3624LQ5
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, five hundred and seventy-four thousand and thirteen
Ordinalthree million, five hundred and seventy-four thousand and thirteenth
Scientific notation3.574013 × 10^6
Engineering notation3.574013 × 10^6
In other bases
Ternary20201120121212base 3; the most digit-efficient integer base after e: 14 digits
Quinary1403332023base 5; one hand: 10 digits
Septenary42243602base 7: 8 digits
Nonary6646555base 9; each digit is two ternary digits: 7 digits
Duodecimal1244365base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal126f0dbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal16:32:46:53base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1T1TTT1T0T0TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10010111001100100001101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001101101000100011111101
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 88 fd
Gray code1011011100110010000011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001101101000100011111101
64-bit0000000000000000000000000000000000000000001101101000100011111101
One's complement11111111110010010111011100000010at 32 bits, every bit flipped
Bits reversed10111111000100010110110000000000at 32 bits
Rotated left by 100000000011011010001000111111010at 32 bits, wrapping
Shifted left by 111011010001000111111010= 7,148,026, no wrap
Shifted right by 1110110100010001111110= 1,787,006, discarding the low bit
These bits as a double1.76579704 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,574,013 to the power 212,773,568,924,169
3,574,013 to the power 345,652,901,391,376,020,197
3,574,013 to the power 4163,164,063,060,495,984,072,340,561
3,574,013 to the power 5583,150,482,511,032,433,522,338,105,441,293
First ten multiples3,574,013, 7,148,026, 10,722,039, 14,296,052, 17,870,065, 21,444,078, 25,018,091, 28,592,104, 32,166,117, 35,740,130
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 1
Divisible by 5No, remainder 3
Divisible by 6No, remainder 5
Divisible by 7No, remainder 2
Divisible by 8No, remainder 5
Divisible by 9No, remainder 5
Divisible by 10No, remainder 3
Divisible by 11No, remainder 3
Divisible by 12No, remainder 5
Divisible by 100No, remainder 13
Collatz (3n + 1) trajectory
Steps to reach 1146the total stopping time
Highest value reached20,355,1365× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,574,013 → 10,722,040 → 5,361,020 → 2,680,510 → 1,340,255 → 4,020,766 → 2,010,383 → 6,031,150 → 3,015,575 → 9,046,726 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage357,401,300%
3,574,013% as a decimal35,740.13
3,574,013% of 1003,574,013
3,574,013% of 1,00035,740,130
As a fraction of 1003,574,013/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,574,013
Nerdulate something else
Nothing in mind? Surprise me · today’s page