Recognised as Number
3,314,501
- Positive
- Odd
- Prime
- 7 digits
3,314,501 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,314,501
Digit count7
Digit sum17
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times 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,314,501
Distinct prime factors13,314,501
Number of divisors2
Sum of divisors σ(n)3,314,502
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,314,500integers below n that share no factor with it
Carmichael function λ(n)3,314,500the 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,314,5012 in total
Arithmetic
Previous number3,314,500
Next number3,314,502
Double6,629,002
Half1,657,250.5
Square10,985,916,879,001
Cube36,412,832,481,365,693,501
Square root1,820.577106304≈irrational, shown to 9 decimal places
Cube root149.098309069≈
Negation-3,314,501
Reciprocal3.0170454 × 10^-7≈
Representations
Decimal3,314,501
Binary110010100100110100010122 bits
Octal14511505
Hexadecimal329345
Base 361Z1HH
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, three hundred and fourteen thousand, five hundred and one
Ordinalthree million, three hundred and fourteen thousand, five hundred and first
Scientific notation3.314501 × 10^6
Engineering notation3.314501 × 10^6
In other bases
Ternary20020101122022base 3; the most digit-efficient integer base after e: 14 digits
Quinary1322031001base 5; one hand: 10 digits
Septenary40113161base 7: 8 digits
Nonary6211568base 9; each digit is two ternary digits: 7 digits
Duodecimal113a145base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal10e651base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal15:20:41:41base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T01T011TT0T10Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101111001011101000101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001100101001001101000101
Bit length22 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits12within that length
Bit parityeven10 set bits, so even; 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
Bytes332 93 45
Gray code1010111101101011100111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001100101001001101000101
64-bit0000000000000000000000000000000000000000001100101001001101000101
One's complement11111111110011010110110010111010at 32 bits, every bit flipped
Bits reversed10100010110010010100110000000000at 32 bits
Rotated left by 100000000011001010010011010001010at 32 bits, wrapping
Shifted left by 111001010010011010001010= 6,629,002, no wrap
Shifted right by 1110010100100110100010= 1,657,250, discarding the low bit
These bits as a double1.63758108 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,314,501 to the power 210,985,916,879,001
3,314,501 to the power 336,412,832,481,365,693,501
3,314,501 to the power 4120,690,369,672,319,072,474,758,001
3,314,501 to the power 5400,028,350,969,271,238,036,657,869,072,501
First ten multiples3,314,501, 6,629,002, 9,943,503, 13,258,004, 16,572,505, 19,887,006, 23,201,507, 26,516,008, 29,830,509, 33,145,010
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 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 1
Divisible by 8No, remainder 5
Divisible by 9No, remainder 8
Divisible by 10No, remainder 1
Divisible by 11No, remainder 3
Divisible by 12No, remainder 5
Divisible by 100No, remainder 1
Collatz (3n + 1) trajectory
Steps to reach 1177the total stopping time
Highest value reached9,943,5043× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,314,501 → 9,943,504 → 4,971,752 → 2,485,876 → 1,242,938 → 621,469 → 1,864,408 → 932,204 → 466,102 → 233,051 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage331,450,100%
3,314,501% as a decimal33,145.01
3,314,501% of 1003,314,501
3,314,501% of 1,00033,145,010
As a fraction of 1003,314,501/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,314,501
Nerdulate something else
Nothing in mind? Surprise me · today’s page